Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- const int N=1e6+1;
- long long a[N],qs[N];
- int main()
- {
- int n,t;
- scanf("%d%d",&n,&t);
- for(int i=1;i<=n;++i)
- scanf("%lld",&a[i]);
- for(int i=0;i<t;++i){
- int l,r,v;
- scanf("%d%d%d",&l,&r,&v);
- qs[l]+=v;
- qs[r+1]-=v;
- }
- for(int i=1;i<=n;++i){
- qs[i]=qs[i-1]+qs[i];
- a[i]+=qs[i];
- printf("%lld ",a[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement