[题解]借教室 二分+差分
区间操作,自然想到差分。
如果在时刻时,操作失败,那么在时刻t之后,操作也一定会失败。
寻找区间端点,自然想到二分。
每次check一下该时间点是否合格,时间复杂度
O
(
n
log
(
n
+
m
)
)
O\left( n \log( n+ m) \right)
O(nlog(n+m)).
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#define ll long long
#define pii pair<int,int>
using namespace std;
const double eps = 1e-10;
const double pi = acos(-1.0);
const int maxn = 1e6 + 10;
int n,m;
int s[maxn],t[maxn];
ll r[maxn],d[maxn];
ll dd[maxn];
inline void add(int l, int r, ll c){
dd[l] += c;
dd[r+1] -= c;
}
bool check(int x){
memset(dd,0,sizeof(dd));
for(int i = 1; i <= n; i++) add(i,i,r[i]);
for(int i = 1; i <= x; i++) add(s[i],t[i],-d[i]);
for(int i = 1; i <= n; i++){
dd[i] = dd[i-1] + dd[i];
if(dd[i] < 0) return 0;
}
return 1;
}
void solve(){
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++){
scanf("%lld",&r[i]);
}
for(int i = 1; i <= m; i++){
scanf("%lld%d%d",&d[i],&s[i],&t[i]);
}
if(check(m)){//注意事先检查是否合格
printf("0\n");
return;
}
int l1 = 1, r1 = m;
while(l1 < r1){
int mid = l1 + r1 >> 1;
if(check(mid)) l1 = mid + 1;
else r1 = mid;
}
printf("-1\n%d\n",r1);
}
int main()
{
solve();
return 0;
}