1 条题解

  • 0
    @ 2025-5-14 9:18:30
    #include <bits/stdc++.h>
    using namespace std;
    int n, p;
    int a[5123456];
    int d[5123456];
    int main()
    {
        cin >> n >> p;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        for (int i = 1; i <= n; i++)
            d[i] = a[i] - a[i - 1];
        while (p--)
        {
            int l, r, x;
            cin >> l >> r >> x;
            d[l] += x;
            d[r + 1] -= x;
        }
        int ans = d[1];
        a[0] = 0;
        for (int i = 1; i <= n; i++)
        {
            a[i] = a[i - 1] + d[i];
            ans = min(ans, a[i]);
        }
        cout << ans << "\n";
        return 0;
    }
    
    
    • 1

    信息

    ID
    3029
    时间
    1000ms
    内存
    125MiB
    难度
    2
    标签
    递交数
    6
    已通过
    3
    上传者