每日一题：数组中最大数对的最小和 亮灯时长（前缀和）

LeetCode每日一题：数组中最大数对的最小和

class Solution {
public:
    int minPairSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int res = 0;
        for (int i = 0; i < nums.size() / 2; i ++ )
            res = max(res, nums[i] + nums[nums.size() - i - 1]);
        return res;
    }
};

Acwing每日一题：亮灯时长

前缀和

1. 维护奇数和偶数区间的前缀和找规律
2. 对区间端点预处理（前缀和的题也许都需要预处理）

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 100010;
int a[N], s1[N], s2[N];
int main()
{
    int T;
    scanf("%d", &T);
    while (T -- )
    {
        int n, m;
        scanf("%d%d", &n, &m);
        for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
        a[ ++ n] = m;
        
        s1[n] = s2[n] = 0;
        for (int i = n - 1; i >= 0; i -- )
        {
            s1[i] = s1[i + 1], s2[i] = s2[i + 1];
            if (i % 2 == 0) s1[i] += a[i + 1] - a[i];
            else s2[i] += a[i + 1] - a[i];
        }
        
        int res = s1[0]; // 初始的时候是所有奇数区间
        for (int i = 0; i < n; i ++ )
        {
            int t = a[i + 1] - a[i];
            if (t == 1) continue;
            res = max(res, s1[0] - s1[i] + s2[i + 1] + t - 1);
        }
        cout << res << endl;
    }
    return 0;
}