题解 | #给定整数序列求连续子串最大和#

#include <iostream>
#include <vector>
#include <sstream>
using namespace std;

int maxSubArray(vector<int>& nums) {
    int maxSum = nums[0];    // 全局最大和
    int currentSum = nums[0]; // 当前子数组和
    
    for(int i = 1; i < nums.size(); i++) {
        // 状态转移：要么加入当前数字，要么重新开始
        currentSum = max(nums[i], currentSum + nums[i]);
        // 更新全局最大和
        maxSum = max(maxSum, currentSum);
    }
    
    return maxSum;
}

int main() {
    string line;
    getline(cin, line);
    
    vector<int> nums;
    stringstream ss(line);
    int num;
    
    while(ss >> num) {
        nums.push_back(num);
    }
    
    cout << maxSubArray(nums) << endl;
    return 0;
}

import java.util.*;

public class Main {
    public static int maxSubArray(int[] nums) {
        int maxSum = nums[0];
        int currentSum = nums[0];
        
        for(int i = 1; i < nums.length; i++) {
            currentSum = Math.max(nums[i], currentSum + nums[i]);
            maxSum = Math.max(maxSum, currentSum);
        }
        
        return maxSum;
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] input = sc.nextLine().split(" ");
        int[] nums = new int[input.length];
        
        for(int i = 0; i < input.length; i++) {
            nums[i] = Integer.parseInt(input[i]);
        }
        
        System.out.println(maxSubArray(nums));
    }
}

def max_sub_array(nums: list) -> int:
    max_sum = nums[0]      # 全局最大和
    current_sum = nums[0]  # 当前子数组和
    
    for i in range(1, len(nums)):
        # 状态转移：要么加入当前数字，要么重新开始
        current_sum = max(nums[i], current_sum + nums[i])
        # 更新全局最大和
        max_sum = max(max_sum, current_sum)
    
    return max_sum

def main():
    nums = list(map(int, input().split()))
    print(max_sub_array(nums))

if __name__ == "__main__":
    main()