难度:4
还是看了一下标签,然后有个印象,这道题貌似需要用到二分,然后就是思考问题的时间了,
解法就是差分+二分,先用差分判断一遍是不是能满足所有人的借教室,然后对1到m进行二分,这个问题具有单调性,因为每次借教室教室的数量都是减少的,所以一旦中间一次借教室满足不了,那么后面的都满足不了,所以这个二分是最小化的二分,找最小的也就是第一份让借教室无法满足的订单,用二分判定即可,
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
const int maxn = 1e6 + 5;
int n, m;
ll a[maxn], b[maxn];
int dd[maxn], ss[maxn], tt[maxn];
bool check(int x) {
int ok = 0;
for (int i = 1; i <= n; i++) {
if (i == 1) b[i] = a[i];
else b[i] = a[i] - a[i - 1];
}
for (int i = 1; i <= x; i++) b[ss[i]] -= dd[i], b[tt[i] + 1] += dd[i];
for (int i = 1; i <= n; i++) {
b[i] += b[i - 1];
if (b[i] < 0) { ok = 1; break; }
}
return ok;
}
int solve(int l, int r) {
while (l < r) {
int mid = (l + r) >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
return l;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (i == 1) b[i] = a[i];
else b[i] = a[i] - a[i - 1];
}
for (int i = 1; i <= m; i++) {
scanf("%d %d %d", &dd[i], &ss[i], &tt[i]);
b[ss[i]] -= dd[i]; b[tt[i] + 1] += dd[i];
}
int ok = 1;
for (int i = 1; i <= n; i++) {
b[i] += b[i - 1];
if (b[i] < 0) { ok = 0; break; }
}
if (ok) cout << 0;
else cout << -1 << endl << solve(1, m);
return 0;
}