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;i<n;i++) {
a[i]=Integer.parseInt(str1[i]);
}
int sum=0;
int max=0;
for (int i=0;i<n;i++) {
if(sum<=0) {
sum=a[i];
}
else {
sum+=a[i];
}
if(sum>max) {
max=sum;
}
}
System.out.println(max);
}
}
//输入描述:1 2 3 -4 5 -6 5
//输出描述:7