CF295A.Greg and Array
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.
输入输出样例
输入#1
3 3 3 1 2 3 1 2 1 1 3 2 2 3 4 1 2 1 3 2 3
输出#1
9 18 17
输入#2
1 1 1 1 1 1 1 1 1
输出#2
2
输入#3
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
输出#3
5 18 31 20