题目:
Given a sequence a[1],a[2],a[3]…a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
分析:
求解最大和子序列。
用sum记录和,当sum值小于0时,重新更新start值。
当sum值大于当前记录的maxsum值时,更新maxsum,maxstart以及maxend。
代码:
#include <iostream>
using namespace std;
int main() {
int n;
int k;
cin>>n;
for (int j=0; j<n; j++) {
int num;
cin>>num;
int start=1,sum=0,maxstart=1,maxend=1,maxsum=-1000001;
for (int i=1; i<=num; i++) {
cin>>k;
sum+=k;
if (sum>maxsum) {
maxsum=sum;
maxstart=start;
maxend=i;
}
if (sum<0) {
sum=0;
start=i+1;
}
}
cout<<"Case "<<j+1<<":"<<endl;
cout<<maxsum<<" ";
cout<<maxstart<<" "<<maxend<<endl;
if ((j+1)!=n) {
cout<<endl;
}
}
return 0;
}