hdu 1003(最大子序列 DP)

//以后尝试着用java写程序

import java.util.Scanner;
public class Main {
//    static final int MIN=-9999;
    public static void main(String[] argv) {
      Scanner cin=new Scanner(System.in);
      int N=cin.nextInt(),n;
      boolean flag=true;
      for(int j=1;j<=N;j++)
      {  
         int sum=0,fr=0,sc=0,t=1,i;
         int max=-9999;
         n=cin.nextInt();
         for(i=1;i<=n;i++)
         {
             sum+=cin.nextInt();
             if(sum>max)
             {
                 max=sum;
                 fr=t;
                 sc=i;
             }
             if(sum<0)
             {   
                 t=i+1;
                 sum=0;
             }
         }
         if(flag)
             flag=false;
         else
             System.out.println();
         System.out.println("Case "+j+":");
         System.out.println(max+" "+fr+" "+sc);
      }
    }
}