题解 | 最大子段和动态规划

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long sum = 0, ans = -100000;
        while (n-- > 0) {
            int x = sc.nextInt();
            if (sum <= 0) sum = x;
            else sum += x;
            if (sum > ans) ans = sum;
        }
        System.out.println(ans);
        sc.close();
    }
}