1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <vector>
 6 #include <climits>
 7 #include <algorithm>
 8 #include <cmath>
 9 #define LL long long
10 using namespace std;
11 int dp[100010],num[100010];
12 int main(){
13     int kase,i,index,ans,n,k = 1;
14     scanf("%d",&kase);
15     while(kase--){
16         scanf("%d",&n);
17         for(i = 1; i <= n; i++)
18             scanf("%d",dp+i);
19         num[1] = 0;
20         ans = dp[index = 1];
21         for(i = 2; i <= n; i++){
22             if(dp[i] <= dp[i-1]+dp[i]){
23                 dp[i] = dp[i-1]+dp[i];
24                 num[i] = num[i-1]+1;
25             }else num[i] = 0;
26             if(ans < dp[i]) ans = dp[index = i];
27         }
28         printf("Case %d:\n",k++);
29         printf("%d %d %d\n",ans,index-num[index],index);
30         if(kase) putchar(‘\n‘);
31     }
32     return 0;
33 }