306183: CF1159A. A pile of stones
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
A pile of stones
题意翻译
有一堆石子,给一个长度为$n$的操作序列,"-"表示取出一个石子,"+"表示放入一个石子,求这堆石子最后至少有几个题目描述
Vasya has a pile, that consists of some number of stones. $ n $ times he either took one stone from the pile or added one stone to the pile. The pile was non-empty before each operation of taking one stone from the pile. You are given $ n $ operations which Vasya has made. Find the minimal possible number of stones that can be in the pile after making these operations.输入输出格式
输入格式
The first line contains one positive integer $ n $ — the number of operations, that have been made by Vasya ( $ 1 \leq n \leq 100 $ ). The next line contains the string $ s $ , consisting of $ n $ symbols, equal to "-" (without quotes) or "+" (without quotes). If Vasya took the stone on $ i $ -th operation, $ s_i $ is equal to "-" (without quotes), if added, $ s_i $ is equal to "+" (without quotes).
输出格式
Print one integer — the minimal possible number of stones that can be in the pile after these $ n $ operations.
输入输出样例
输入样例 #1
3
---
输出样例 #1
0
输入样例 #2
4
++++
输出样例 #2
4
输入样例 #3
2
-+
输出样例 #3
1
输入样例 #4
5
++-++
输出样例 #4
3