牛客连续最大和

import java.util.Scanner;

//连续最大和
//一个数组有N个元素，求连续自数字的最大和
//[-1,2,1],和最大的连续字数组为[2,1],其和为3
public class ConMaxSum {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n =0;
        while(sc.hasNext()){
            n = sc.nextInt();
            int[] num = new int[n];
            for (int i =0; i <n; i++){
                num[i] = sc.nextInt();
            }
            int max = num[0];
            int sum = num[0];
            for (int i = 1; i<n; i++){
                if (sum >= 0){
                    sum += num[i];
                } else {
                    sum = num[i];
                }
                if (sum > max) {
                    max = sum;
                }
            }
            System.out.println(max);
        }
    }
}