51Nod 1049 最大子段和

题目链接

只要大于0就继续加

#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;int main(){int n,a[50001];cin>>n;int flag=0;for(int i=0;i<n;i++) {cin>>a[i];if(a[i]>=0) flag=1;}if(!flag){cout<<0;return 0;}long long sum=a[0],temp=a[0];for(int i=1;i<n;i++){if(temp<0){temp=a[i];}else{temp+=a[i];}if(temp>sum) sum=temp;}cout<<sum; return 0;}