典型题目:HDU - 1003
typedef long long ll;
typedef unsigned long long ull;
const ll maxn=100005;
ll a[maxn];
int main() {
ll t;
slld(t);
for(ll i=1;i<=t;i++) {
if(i!=1) pn();
ll n;
slld(n);
for(ll j=1;j<=n;j++) slld(a[j]);
ll ans=-INF;
ll sum=0;
ll Left=1,Right=1;
ll l=1;
for(ll j=1;j<=n;j++) {
sum+=a[j];
if(sum>ans) { //易错点,要先判是否满足最大条件
ans=sum;
Left=l;
Right=j;
}
if(sum<0) {
sum=0;
l=j+1;
}
}
printf("Case %lld:\n",i);
printf("%lld %lld %lld\n",ans,Left,Right);
}
return 0;
}