http://acm.hdu.edu.cn/showproblem.php?pid=1003
动态规划。。。。。和第1231道题不同,这道题有负数!
wa了n次。。。。。悲剧
#include <iostream>
using namespace std;
int a[100010];
int main()
{
int T;
cin>>T;
for(int c=1;c<=T;c++){
int N;
cin>>N;
int i,j=0,sum=0,max=-1,s=0,e=0;
for(i=0;i<N;i++)
scanf("%d",&a[i]);
max=a[0];
for(i=0;i<N;i++){
if(sum+a[i]<a[i]){
sum=a[i];
j=i;
}
else sum+=a[i];
if(sum>max){
s=j;
e=i;
max=sum;
}
}
cout<<"Case "<<c<<":"<<endl;
cout<<max<<" "<<s+1<<" "<<e+1<<endl;
if(c!=T) cout<<endl;
}
return 0;
}