Greg has an array a = a1, a2, ..., an and m operations. Each operation looks as: li, ri, di, (1 ≤ li ≤ ri ≤ n). To apply operation i to the array means to increase all array elements with numbers li, li + 1, ..., ri by value di.
Greg wrote down k queries on a piece of paper. Each query has the following form: xi, yi, (1 ≤ xi ≤ yi ≤ m). That means that one should apply operations with numbers xi, xi + 1, ..., yi to the array.
Now Greg is wondering, what the array a will be after all the queries are executed. Help Greg.
The first line contains integers n, m, k (1 ≤ n, m, k ≤ 105). The second line contains n integers: a1, a2, ..., an (0 ≤ ai ≤ 105) — the initial array.
Next m lines contain operations, the operation number i is written as three integers: li, ri, di, (1 ≤ li ≤ ri ≤ n), (0 ≤ di ≤ 105).
Next k lines contain the queries, the query number i is written as two integers: xi, yi, (1 ≤ xi ≤ yi ≤ m).
The numbers in the lines are separated by single spaces.
On a single line print n integers a1, a2, ..., an — the array after executing all the queries. Separate the printed numbers by spaces.
Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.
3 3 3 1 2 3 1 2 1 1 3 2 2 3 4 1 2 1 3 2 3
9 18 17
1 1 1 1 1 1 1 1 1
2
4 3 6 1 2 3 4 1 2 1 2 3 2 3 4 4 1 2 1 3 2 3 1 2 1 3 2 3
for(int i = 1;i <= m;i++){
countn[l[i]-1] += d[i];countn[r[i]] -= d[i];
}
sum = 0;
for(int i = 0;i <= n;i++){
a[i] += sum;sum += countn[i];
}
读者自己动手模拟一遍就能看出里面的思路了
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
using namespace std;
const int maxn = 100100;
LL a[maxn],l[maxn],r[maxn],d[maxn];
LL countn[maxn],ll[maxn],rr[maxn];
int main(){
int n,m,k;
while(scanf("%d%d%d",&n,&m,&k) != EOF){
for(int i = 1;i <= n;i++)
cin >> a[i];
for(int i = 1;i <= m;i++)
cin >> l[i] >> r[i] >> d[i];
memset(countn,0,sizeof(countn));
for(int i = 0;i < k;i++){
int teml,temr;
cin >> teml >> temr;
countn[teml-1] += 1;countn[temr] -= 1;
}
LL sum = 0;
for(int i = 0;i <= m;i++){
d[i] *= sum;
sum += countn[i];
}
memset(countn,0,sizeof(countn));
for(int i = 1;i <= m;i++){
countn[l[i]-1] += d[i];countn[r[i]] -= d[i];
}
sum = 0;
for(int i = 0;i <= n;i++){
a[i] += sum;sum += countn[i];
}
for(int i = 1;i < n;i++) cout << a[i] << ' ';
cout << a[n] << endl;
}
return 0;
}