Week5 B - TT's Magic Cat

Week5 B - TT’s Magic Cat
Thanks to everyone’s help last week, TT finally got a cute cat. But what TT didn’t expect is that this is a magic cat.

One day, the magic cat decided to investigate TT’s ability by giving a problem to him. That is select n cities from the world map, and a[i] represents the asset value owned by the i-th city.

Then the magic cat will perform several operations. Each turn is to choose the city in the interval [l,r] and increase their asset value by c. And finally, it is required to give the asset value of each city after q operations.

Could you help TT find the answer?

Input
The first line contains two integers n,q (1≤n,q≤2⋅105) — the number of cities and operations.

The second line contains elements of the sequence a: integer numbers a1,a2,…,an (−106≤ai≤106).

Then q lines follow, each line represents an operation. The i-th line contains three integers l,r and c (1≤l≤r≤n,−105≤c≤105) for the i-th operation.

Output
Print n integers a1,a2,…,an one per line, and ai should be equal to the final asset value of the i-th city.

Examples
Input

4 2
-3 6 8 4
4 4 -2
3 3 1

Output

-3 6 9 2

Input

2 1
5 -2
1 2 4

Output

9 2

Input

1 2
0
1 1 -8
1 1 -6

Output

-14

Problem-solving ideas
in this problem, we need to use the difference with every ai
connect every point by difference
difference point =A(i+1)-Ai
we don’t need to increase the value of each point from point Ai to point Ar just increase the Ai-A(i-1) and decrease the point A(r+1)-Ar
Code

#include<iostream>
#include<stack>
using namespace std;
int n,q;
long long a[300000];
long long b[300000];
long long l,r,c;
int main(){
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		b[i]=a[i]-a[i-1];
	}
	for(int i=0;i<q;i++){
		cin>>l>>r>>c;
		b[l]+=c;
		b[r+1]-=c;
	}
	long long ans=0;
	for(int i=1;i<=n;i++){
		ans+=b[i];
		cout<<ans;
		if(i!=n)cout<<' ';
	}cout<<endl;
}