1 #include <iostream>
2 #include <cstdio>
3 #include <cmath>
4 #include <cstring>
5 #include <algorithm>
6 #include <queue>
7 #include <stack>
8 #include <vector>
9 using namespace std;
10 int main(int argc, char *argv[])
11 {
12 int t,n,ans=0,a[100010],dp[100010],temp,minx,maxx,summax,thiss;
13 scanf("%d",&t);
14 while(t--)
15 {
16 ans++;
17 scanf("%d",&n);
18 for(int i=0;i<n;i++)
19 scanf("%d",&a[i]);
20 summax=-10000;minx=maxx=0;thiss=0;temp=1;
21 for(int i=0;i<n;i++)
22 {
23 thiss+=a[i];
24 if(thiss>summax)
25 {
26 summax=thiss;
27 maxx=i+1;
28 minx=temp;
29 }
30 if(thiss<0)
31 {
32 thiss=0;
33 temp=i+2;
34 }
35 }
36 printf("Case %d:\n%d %d %d\n",ans,summax,minx,maxx);
37 if(t)
38 printf("\n");
39 }
40
41 return 0;
42 }
