#include <iostream> using namespace std; int main() { int t,n,i,j,a[100000]; int sum,s1,s2,e,max,k=0; cin>>t; while(t--) { cin>>n; //memset(a,a+n;sizeof(a)); for(i=0;i<n;i++) { cin>>a[i]; } max=a[0];s1=s2=0;e=1;sum=0; for(j=0;j<n;j++) { sum+=a[j]; if(sum>max) { max=sum; s1=s2; e=j+1; } if(sum<0) { sum=0; s2=j+1; //count=j+2; } } cout << "Case "<< ++k<<":"<<endl<<max<<" "<<s1+1<<" "<<e<<endl; if(t) cout<<endl; } return 0; }
max num
最新推荐文章于 2019-08-14 06:51:39 发布