课堂练习--求和最大的子数组

import java.util.Scanner;
public class Submax {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        System.out.println("please input the number of the array date");
        int a=in.nextInt();
        int []date=new int[a];
        System.out.println("input the number (Int):");
        for(int i=0;i<a;i++)         //用户输入数字
        {
            date[i]=in.nextInt();
        }
        int sum=0,max=date[0];
        int startIndex=0,endIndex=0;
        for(int i=0;i<a;i++)        //进行一次遍历
        {
            if(sum>=0)
            {
                sum+=date[i];         //和为正数时一直相加
            }
            else
            {
                sum=date[i];
                startIndex=i;         //和为负数时记录下一个数
            }
            if(sum>max)
            {
                max=sum;
                endIndex=i;            //求最大值
            }
        }
        System.out.println("the max subarray is:");
        for(int i=startIndex;i<=endIndex;i++)
        {
            System.out.println(date[i]+"  ");//输出子数组
        }
        System.out.println("the max is:"+max);
    }

}