一个很简单的算法题,求最小的前缀和,就是要注意数据范围要开一个longlong
#include<iostream> using namespace std; int main() { int n; while(cin>>n) { int minn=999999999; long long total=0; int temp; for(int i=0;i<n;i++) { cin>>temp; total+=temp; if(minn>total) minn=total; } if(minn>=0) cout<<"0 "; else cout<<minn*-1<<endl; } return 0; }