60求调
查看原帖
60求调
700986
IkunFriendsChat楼主2022/10/16 13:03
#include<cstdio>
#include<cmath>
#include<iostream>
using namespace std;
long long s[1145140],gb[1145140],i,j,n,ans;
bool check(int i,int n)
{
	return(s[n]-s[i-1]>=0&&s[i-1]>=0);
}
int main()
{
	//freopen("P2629_3.in","r",stdin);
	scanf("%lld",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%lld",&gb[i]);
		s[i]=gb[i]+s[i-1];
	}
	for(i=1;i<=n;i++)
	{
		if(check(i,n))ans++;
	}
	printf("%lld",ans);
}
2022/10/16 13:03
加载中...