1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e6+10;
struct st{
int d,s,t;
};
st s[N];
int n,m;
int r[N];
long long diff[N];
bool check(int m)
{memset( diff, 0, sizeof diff);
for(int i=1;i<=m;i++)
{ diff[s[i].s]+=s[i].d;
diff[s[i].t+1]-=s[i].d;}
for(int i=1;i<=n;i++)
{diff[i]+=diff[i-1];
if(r[i]<diff[i])
return false;}
return true;
}
int main()
{
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",&s[i].d,&s[i].s,&s[i].t);
int l=1,r=m;
while(r>l)
{int mid=(r+l+1)>>1;
if(check(mid))
l=mid;
else r=mid-1;
}
if(l==m)
cout<<0;
else cout<<-1<<endl<<r+1;
return 0;
}
|