Codeforces 295A Greg and Array

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.

Input

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.

Output

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 %I64dspecifier.

Sample test(s)

input

3 3 3
1 2 3
1 2 1
1 3 2
2 3 4
1 2
1 3
2 3

output

9 18 17

input

1 1 1
1
1 1 1
1 1

output

2

input

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

output

5 18 31 20

解题思路：此题当然可以利用线段树来更新区间并且求和，只是在此处掌握一种新的技巧，这题N年前做过，非常有用的一个技巧，mark一下。

#include <ctime>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <numeric>
#include <utility>
#include <algorithm>
#include <functional>
using namespace std;
const int maxn = 100010;
typedef long long ll;
struct OP {
    int l, r, d;
    OP() { }
    OP(int t_l, int t_r, int t_d) : l(t_l), r(t_r), d(t_d) { }
}op[maxn];
int op_cnt[maxn];
ll  arr[maxn];
ll  add[maxn];
int n, m, k;

int main() {

    //freopen("aa.in", "r", stdin);

    int l, r;
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1; i <= n; ++i) {
        scanf("%I64d", &arr[i]);
    }
    for(int i = 1; i <= m; ++i) {
        scanf("%d %d %d", &op[i].l, &op[i].r, &op[i].d);
    }
    memset(op_cnt, 0, sizeof(op_cnt));
    for(int i = 1; i <= k; ++i) {
        scanf("%d %d", &l, &r);
        op_cnt[l] += 1;
        op_cnt[r+1] -= 1;
    }
    for(int i = 1; i <= m; ++i) {
        op_cnt[i] += op_cnt[i-1];
    }
    memset(add, 0, sizeof(add));
    for(int i = 1; i <= m; ++i) {
        add[op[i].l] += 1LL * op_cnt[i] * op[i].d;
        add[op[i].r+1] -= 1LL * op_cnt[i] * op[i].d;
    }
    for(int i = 1; i <= n; ++i) {
        add[i] += add[i-1];
    }
    for(int i = 1; i <= n; ++i) {
        arr[i] += add[i];
    }
    printf("%I64d", arr[1]);
    for(int i = 2; i <= n; ++i) {
        printf(" %I64d", arr[i]);
    }
    printf("\n");
    return 0;
}