P1083 [NOIP2012 提高组] 借教室(差分+二分)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
ll a[MAXN];
ll s[MAXN];
ll d[MAXN];
int st[MAXN];
int ed[MAXN];

bool judge(int mid) {
	memset(a, 0, sizeof(a));
	for (int i = 1; i <= mid; i++) {
		a[st[i]] += d[i];
		a[ed[i] + 1] -= d[i];
	}
	ll rec = 0;
	//putchar('\n');
	for (int i = 1; i <= n; i++) {
		rec += a[i];
		if (rec > s[i]) {
			//printf("i=%d\nrec=%d\n", i, rec);
			return false;
		}
	}
	return true;
}


int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%lld", s + i);
	}
	for (int i = 1; i <= m; i++) {
		scanf("%lld %d %d", d + i, st + i, ed + i);
	}
	if (judge(m)) {
		printf("0");
		return 0;
	}
	int l = 1, r = m;
	while (l <= r) {
		int mid = l + r >> 1;
		if (judge(mid))
			l = mid + 1;
		else
			r = mid - 1;
	}
	printf("-1\n%d", l);
	return 0;
}

[NOIP2012 提高组] 借教室 - 洛谷https://www.luogu.com.cn/problem/P1083本来是一道练习线段树的题，但我发现它写的太麻烦了，就没用