https://www.luogu.org/problemnew/show/P1083
#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 1000005
using namespace std;
int LEFT,MID,RIGHT,n,m,r[maxn],d[maxn],s[maxn],t[maxn],day[maxn];
bool judge(int mid)
{
memset(day,0,sizeof(day));
for (int i=1;i<=mid;i++)
{
day[s[i]]+=d[i];
day[t[i]+1]-=d[i];
}
if (day[1]>r[1])
return 1;
for (int i=2;i<=n;i++)
{
day[i]+=day[i-1];
if (day[i]>r[i])
return 1;
}
//cout << -1 << endl;
return 0;
}
int main()
{
//freopen("classroom.in","r",stdin);
//freopen("classroom.ans","w",stdout);
cin >> n >> m;
for (int i=1;i<=n;i++)
scanf("%d",&r[i]);
for (int i=1;i<=m;i++)
scanf("%d%d%d",&d[i],&s[i],&t[i]);
LEFT=1;RIGHT=m;
while (LEFT<RIGHT)
{
MID=(LEFT+RIGHT)/2;
//cout << LEFT << " " << RIGHT << " " << MID << endl;
if (judge(MID))
RIGHT=MID;
else LEFT=MID+1;
}
if (m!=RIGHT)
{
cout << -1 << endl;
cout << RIGHT << endl;
}
else cout << 0 << endl;
return 0;
}