笔试+刷题

qunar2019：连续子数组和最大

package com.qunar;

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input =new Scanner(System.in);
		//int N=input.nextInt();
		String str=input.nextLine();
		String[] str1=str.split(" ");
		int n=str1.length;
		int[] a=new int[n];
		for (int i=0;imax) {
				max=sum;
			}
		}
		System.out.println(max);

	}

}
//输入描述：1 2 3 -4 5 -6 5
//输出描述：7