n = int(input())
li = list(map(int, input().split()))
count = 0
p = 0
for i in range(n):
if li[i] == -1 and p == 0:
count += 1
elif li[i] != -1:
p += li[i]
elif li[i] == -1 and p != 0:
p += li[i]
print(count)#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, y, x=0, c=0;
cin>>n;
int a[n];
for(int i=0; i<n; i++)
cin>>a[i];
for(int j=0; j<n; j++)
{
if(a[j]>0)
x+=a[j];
if(a[j]==-1)
{y = x-1;
if(y<0)
c++;
else
x--;}
}
cout<<c;
return 0;
}74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |