51Nod1344 走格子

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_42391248/article/details/84197075

没什么好说的，就是简单。。。

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
int main()
{	
	int n;
	cin>>n;
	ll a[50005];
	for(int i=0;i<n;i++)
		cin>>a[i];
	ll sum=500000000;
	ll minn=sum;
	for(int i=0;i<n;i++)
	{
		sum+=a[i];
		minn=min(sum,minn);
	}
	if(500000000-minn<=0)
		cout<<"0"<<endl;
	else
		cout<<500000000-minn<<endl;
	return 0; 
}