NOIP 2012提高组 借教室

二分答案+差分+前缀和

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define maxn 1000005
using namespace std;

int a[maxn],d[maxn],s[maxn],j[maxn],t[maxn];
int n,m;

bool can(int num)
{
    int tmp = 0;
    memset(t, 0, sizeof(t));
    for (int i = 1; i <= num; i++)
    {
        t[s[i]] -= d[i];
        t[j[i] + 1] += d[i];
    }
    for (int i = 1; i <= n; i++)
    {
        tmp += t[i];
        if (tmp + a[i] < 0)
            return false;
    }
    return true;
}

int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    for (int i = 1; i <= m; i++)
        scanf("%d%d%d", &d[i], &s[i], &j[i]);
    if (can(m))
        printf("0");
    else
    {
        int l = 1, r = m, mid;
        while (l < r)
        {
            mid = (l + r) / 2;
            if (can(mid))
                l = mid + 1;
            else
                r = mid;
        }
        printf("-1\n%d", r);
    }

    return 0;
}