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

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    int sum = -1, temp = 0;
    
    for(int i = 0; i < N; i++) {
        int num;
        cin >> num;
        temp += num;
        
        // 如果当前和为负，放弃之前的子数组
        if(temp < 0) {
            temp = 0;
        }
        else {
            sum = max(sum, temp);
        }
    }
    
    cout << sum << endl;
    return 0;
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int sum = -1, temp = 0;
        
        for(int i = 0; i < N; i++) {
            int num = sc.nextInt();
            temp += num;
            
            if(temp < 0) {
                temp = 0;
            }
            else {
                sum = Math.max(sum, temp);
            }
        }
        
        System.out.println(sum);
    }
}

n = int(input())

sum_max = -1
temp = 0

for _ in range(n):
    num = int(input())
    temp += num
    
    if temp < 0:
        temp = 0
    else:
        sum_max = max(sum_max, temp)

print(sum_max)