95求调

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;

long long n;
vector<long long>mg(MAXN);
vector<long long>summ(MAXN);
long long ans;
bool bj = 1;
long long tpSum;

int main(){
	cin >> n;
	for(long long i = 0 ; i < n ; i++){
		cin >> mg[i];
		tpSum += mg[i];
	}
	if(tpSum < 0){
		cout << 0;
		return 0;
	}
	for(long long i = 0 ; i < n ; i++){
		bj = 1;
		for(long long j = i ; j < n ; j++){
			summ[i] += mg[j];
			if(summ[i]<0){
				bj = 0;
				break;
			}
		}
		if(bj == 0) continue;
		for(long long j = 0 ; j < i ; j++){
			summ[i] += mg[j];
			if(summ[i]<0){
				bj = 0;
				break;
			}
		}
		if(bj) ans++;
	}
	cout << ans;
	return 0;
}//TLE 1