连续子树最大和

import java.util.Scanner;

public class Main{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] arr = new int[n];
        for(int i = 0; i< n; i++){
            arr[i] = in.nextInt(); 
        }
        int res = arr[0];
        int cursum = arr[0];
        for(int i = 1; i < n; i++){
            cursum += arr[i];
            if(cursum <= 0){
                cursum = arr[i];
            }
            if(cursum > res){
                res = cursum;
            }
        }
        System.out.println(res);
    }
}