题解 | #子数组最大连续和#

不保存到数组，时间O(n)，空间O(1)。不到双百。

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long cur = 0, max = Integer.MIN_VALUE;
        int n = in.nextInt();
        
        for (int i=0; i<n; ++i) {
            int tmp = in.nextInt();
            cur = Math.max(cur + tmp, tmp);
            max = Math.max(cur, max);
        }
        
        System.out.println(max);
    }
}