【无标题】LeetCode 2321. 拼接数组的最大分数

LeetCode 2321. 拼接数组的最大分数

前缀和、区间最大值

class Solution {
    
public:
    int process(vector<int>& a, vector<int>& b)
    {
    
        int sum = 0;
        for(auto& n : a) sum += n;
        int dt = 0, t = 0;
        for(int i = 0; i < a.size(); i ++)
        {
    
            t = max(t + b[i] - a[i], b[i] - a[i]);
            dt = max(dt, t);
        }
        return sum + dt;
    }
    int maximumsSplicedArray(vector<int>& nums1, vector<int>& nums2) {
    
        return max(process(nums1, nums2), process(nums2, nums1));
    }
};