51Nod 1049 最大子段和

题目链接：​​https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1049​​

1 #include<iostream>
 2 #include<algorithm>
 3 using namespace std;
 4 long long a[50005];
 5 long long b[50005];
 6 int main()
 7 {
 8     int n;
 9     cin>>n;
10     for(int i=0;i<n;i++){
11         cin>>a[i];
12     }
13     long long sum=0;
14     b[0]=a[0];
15     for(int i=1;i<n;i++){
16         if(b[i-1]>0){
17             b[i]=b[i-1]+a[i];
18         }
19         else{
20             b[i]=a[i];
21         }
22         if(b[i]>sum)sum=b[i];
23     }
24     cout<<sum<<endl;
25     return 0;
26 }