算法分析：Maximum Subsequence Sum

import java.util.Scanner;
class Main 
{
	int numOfIntegers;
	String sequenceStr;
    int []sequence;
	void init(){
       try{ 
	   Scanner reader1=new Scanner(System.in);
	   numOfIntegers=reader1.nextInt();
       sequence=new int[numOfIntegers];
	   Scanner reader2=new Scanner(System.in);
	   sequenceStr=reader2.nextLine();
	   } catch(Exception e){}
	}
	void trans(){
         String []tmp=sequenceStr.split(" ");
	   	 for(int i=0;i<numOfIntegers;i++){
			 sequence[i]= Integer.parseInt(tmp[i]);  
		 }
	}
	 int select(int[] index){
		int sumMax=sequence[0];
		int tmp;
		for(int i=0;i< numOfIntegers;i++){
			tmp=0;
			for(int j=i;j<numOfIntegers;j++){
				tmp+=sequence[j];
				if(tmp>sumMax){
					sumMax=tmp;
                    index[0]=i;
					index[1]=j;
				}
			}		
		} 
		return sumMax;
	}
	boolean isNegative(){
        boolean flag=true;
		for (int i=0;i< numOfIntegers;i++)
        {
			if(sequence[i]>0)
				flag=false;
        }
		return flag;
	}
	public static void main(String[] args) 
	{
		int[] index=new int[2];
		int sum=0;
		Main test=new Main();
		test.init();
        test.trans();
		sum=test.select(index);
		if(test.isNegative()){
			sum=0;
			index[0]=0;
			index[1]=test.numOfIntegers-1;
		}
		System.out.print(sum+" "+index[0]+" "+index[1]);
		
	}
}