95 求助 第14个点 调一下午已猝

#include <cstdio>
#include <cstring>
using namespace std;

const int maxn=1000100;
int n,m,r[maxn],d[maxn],judge[maxn];
struct node{
	int num,s,t;
}mes[maxn];

int check(int x){
	memset(judge,0,sizeof(judge));
	for(int i=1;i<=x;++i)
	  judge[mes[i].s]-=mes[i].num,judge[mes[i].t+1]+=mes[i].num;
	for(int i=1;i<=n;++i){
		judge[i]+=judge[i-1];
		if(r[i]+judge[i]<0) return 0;
	}
	return 1;
}

int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)
	  scanf("%d",&r[i]);
	for(int i=1;i<=m;++i){
		scanf("%d%d%d",&mes[i].num,&mes[i].s,&mes[i].t);
		d[mes[i].s]-=mes[i].num,d[mes[i].t+1]+=mes[i].num;
	}
	for(int i=1;i<=n;++i){
		d[i]+=d[i-1];
		if(r[i]+d[i]<0){
			printf("-1\n");
			int l=1,r=m;
			while(l<r){
				int mid=(l+r+1)>>1;
				if(check(mid))  l=mid;
				else r=mid-1;
			}
			printf("%d",l+1);
			return 0;
		}
	}
	printf("0");
	return 0;
}