Codeforces 295A Greg and Array

#define _CRT_SECURE_NO_WARNINGS
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;


const int MAXN = 1e5 + 5;
long long segTree[MAXN << 2];
long long addMark[MAXN << 2];
long long arr[MAXN];

struct op {
	long long l;
	long long r;
	long long addV;
}op[MAXN];

void pushDown(long long root) {
	if (addMark[root] != 0) {
		addMark[root << 1] += addMark[root];
		addMark[root << 1 | 1] += addMark[root];
		segTree[root << 1] += addMark[root];
		segTree[root << 1 | 1] += addMark[root];
		addMark[root] = 0;
	}
}

void intervalUpdate(long long root, long long ul, long long ur, long long rl, long long rr, long long addVal) {
	if (ul > rr || ur < rl) {
		return;
	}
	if (ul <= rl&&ur >= rr) {
		addMark[root] += addVal;
		segTree[root] += addVal;
		return;
	}
	pushDown(root);
	long long mid = (rl + rr) >> 1;
	intervalUpdate(root << 1, ul, ur, rl, mid, addVal);
	intervalUpdate(root << 1 | 1, ul, ur, mid + 1, rr, addVal);
	segTree[root] = max(segTree[root << 1], segTree[root << 1 | 1]);
}

void buildTree(long long root, long long left, long long right, long long a[]) {
	if (left == right) {
		segTree[root] = a[left];
		return;
	}
	int mid = (left + right) >> 1;
	buildTree(root << 1, left, mid, a);
	buildTree(root << 1 | 1, mid + 1, right, a);
	segTree[root] = max(segTree[root << 1], segTree[root << 1 | 1]);
}

long long query(long long root, long long ql, long long qr, long long rl, long long rr) {
	if (ql > rr || qr < rl)
		return -1;
	if (ql <= rl&&rr <= qr)
		return segTree[root];
	int mid = (rl + rr) >> 1;
	pushDown(root);
	return max(query(root << 1, ql, qr, rl, mid), query(root << 1 | 1, ql, qr, mid + 1, rr));
}

long long n, m, k;
long long temp[MAXN];


int main() {
	scanf("%lld %lld %lld", &n, &m, &k);
	for (long long i = 1;i <= n;++i) {
		scanf("%lld", &temp[i]);
	}
	for (long long i = 1;i <= m;++i) {
		scanf("%lld %lld %lld", &op[i].l, &op[i].r, &op[i].addV);
	}
	buildTree(1, 1, m, arr);
	for (long long i = 1;i <= k;++i) {
		long long a, b;
		scanf("%lld %lld", &a, &b);
		intervalUpdate(1, a, b, 1, m, 1);
	}
	for (long long i = 1;i <= m;++i) {
		arr[i] = query(1, i, i, 1, m);
		op[i].addV = op[i].addV*arr[i];
	}
	for (int i = 0;i < MAXN;++i) {
		addMark[i] = 0;
	}
	buildTree(1, 1, n, temp);
	for (long long i = 1;i <= m;++i) {
		intervalUpdate(1, op[i].l, op[i].r, 1, n, op[i].addV);
	}
	for (long long i = 1;i <= n;++i) {
		temp[i] = query(1, i, i, 1, n);
	}
	for (long long i = 1;i <= n;++i) {
		printf("%lld ", temp[i]);
	}
	//system("pause");
	return 0;
}