1 // 2 //by coolxxx 3 //#include<bits/stdc++.h> 4 #include<iostream> 5 #include<algorithm> 6 #include<string> 7 #include<iomanip> 8 #include<map> 9 #include<memory.h>10 #include<time.h>11 #include<stdio.h>12 #include<stdlib.h>13 #include<string.h>14 //#include<stdbool.h>15 #include<math.h>16 #define min(a,b) ((a)<(b)?(a):(b))17 #define max(a,b) ((a)>(b)?(a):(b))18 #define abs(a) ((a)>0?(a):(-(a)))19 #define lowbit(a) (a&(-a))20 #define sqr(a) ((a)*(a))21 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))22 #define mem(a,b) memset(a,b,sizeof(a))23 #define eps (1e-8)24 #define J 1025 #define mod 100000000726 #define MAX 0x7f7f7f7f27 #define PI 3.1415926535897932328 #define N 100000429 using namespace std;30 typedef long long LL;31 int cas,cass;32 int n,m,lll,ans;33 LL a[N];34 int main()35 {36     #ifndef ONLINE_JUDGE37 //    freopen("1.txt","r",stdin);38 //    freopen("2.txt","w",stdout);39     #endif40     int i,j,k;41 //    for(scanf("%d",&cas);cas;cas--)42 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)43 //    while(~scanf("%s",s+1))44     while(~scanf("%d",&n))45     {46         for(i=1;i<=n;i++)47             scanf("%lld",&a[i]);48         ans=n;49         for(i=n;i;i--)50         {51             if(a[i]<0)52             {53                 j=i;54                 while(a[j]<0)a[j]+=a[--i];55                 ans-=j-i;56             }57         }58         printf("%d\n",ans);59     }60     return 0;61 }62 /*63 //64 65 //66 */