Greg and Array--线段树建两棵树

题目链接：https://cn.vjudge.net/problem/CodeForces-296C

题目大意

给出长度为n的序列，有m种操作，然后k行，每次给出要执行的操作种类，例如1 3，是将1--3折三种操作进行一次。求最后的序列是多少。

分析

对原始序列进行操作，需要建一棵树来维护，而每次要执行的操作区间，也要建一棵树来维护，所以一共需要建两棵树。

代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1e5+5;
int n, m, k;
struct OP{
	int l, r;
	ll w;
}op[N];
struct node{
	int l, r;
	ll sum, lazy;
}tr1[N<<2], tr2[N<<2];
void pushup1(int m)
{
	tr1[m].sum = tr1[m<<1].sum + tr1[m<<1|1].sum;
}
void pushdown1(int m)
{
	if(tr1[m].lazy)
	{
		tr1[m<<1].lazy += tr1[m].lazy;
		tr1[m<<1|1].lazy += tr1[m].lazy;
		tr1[m<<1].sum += (tr1[m<<1].r - tr1[m<<1].l + 1) * tr1[m].lazy;
		tr1[m<<1|1].sum += (tr1[m<<1|1].r - tr1[m<<1|1].l + 1) * tr1[m].lazy;
		tr1[m].lazy = 0;
	}
}
//n
void build1(int m, int l, int r)
{
	tr1[m].l = l;
	tr1[m].r = r;
	tr1[m].lazy = 0;
	if(l == r)
	{
		scanf("%lld", &tr1[m].sum);
		return ;
	}
	int mid = (l + r) >> 1;
	build1(m<<1, l, mid);
	build1(m<<1|1, mid + 1, r);
	pushup1(m);
}
void updata1(int m, int l, int r, ll val)
{
	if(tr1[m].l == l && tr1[m].r == r)
	{
		tr1[m].sum += (ll)(r - l + 1) * val;
		tr1[m].lazy += val;
		return ;
	}
	pushdown1(m);
	int mid = (tr1[m].l + tr1[m].r) >> 1;
	if(r <= mid) updata1(m<<1, l, r, val);
	else if(l > mid) updata1(m<<1|1, l, r, val);
	else
	{
		updata1(m<<1, l, mid, val);
		updata1(m<<1|1, mid + 1, r, val);
	}
	pushup1(m);
}
ll ask1(int m, int id)
{
	if(tr1[m].l == id && tr1[m].r == id) return tr1[m].sum;
	pushdown1(m);
	int mid = (tr1[m].l + tr1[m].r) >> 1;
	if(id <= mid) return ask1(m<<1, id);
	else return ask1(m<<1|1, id);
}
//m
void pushup2(int m)
{
	tr2[m].sum = tr2[m<<1].sum + tr2[m<<1|1].sum;
}
void pushdown2(int m)
{
	if(tr2[m].lazy)
	{
		tr2[m<<1].lazy += tr2[m].lazy;
		tr2[m<<1|1].lazy += tr2[m].lazy;
		tr2[m<<1].sum += (tr2[m<<1].r - tr2[m<<1].l + 1) * tr2[m].lazy;
		tr2[m<<1|1].sum += (tr2[m<<1|1].r - tr2[m<<1|1].l + 1) * tr2[m].lazy;
		tr2[m].lazy = 0;
	}
}
void build2(int m, int l, int r)
{
	tr2[m].l = l;
	tr2[m].r = r;
	tr2[m].lazy = 0;
	tr2[m].sum = 0;
	if(l == r) return ;
	int mid = (l + r) >> 1;
	build2(m<<1, l, mid);
	build2(m<<1|1, mid + 1, r);
	pushup2(m);
}
void updata2(int m, int l, int r, ll val)
{
	if(tr2[m].l == l && tr2[m].r == r)
	{
		tr2[m].sum += (ll)(r - l + 1) * val;
		tr2[m].lazy += val;
		return ;
	}
	pushdown2(m);
	int mid = (tr2[m].l + tr2[m].r) >> 1;
	if(r <= mid) updata2(m<<1, l, r, val);
	else if(l > mid) updata2(m<<1|1, l, r, val);
	else
	{
		updata2(m<<1, l, mid, val);
		updata2(m<<1|1, mid + 1, r, val);
	}
	pushup2(m);
}
ll ask2(int m, int id)
{
	if(tr2[m].l == id && tr2[m].r == id) return tr2[m].sum;
	pushdown2(m);
	int mid = (tr2[m].l + tr2[m].r) >> 1;
	if(id <= mid) return ask2(m<<1, id);
	else return ask2(m<<1|1, id);
}
int main()
{
	while(~scanf("%d %d %d", &n, &m, &k))
	{
		build1(1, 1, n);
		build2(1, 1, m);
		for(int i = 1; i <= m; i++)
			scanf("%d %d %lld", &op[i].l, &op[i].r, &op[i].w);
		while(k--)
		{
			int l, r;
			scanf("%d %d", &l, &r);
			updata2(1, l, r, 1);
		}
		for(int i = 1; i <= m; i++)
		{
			ll x = ask2(1, i);
			updata1(1, op[i].l, op[i].r, op[i].w * x);
		}
		for(int i = 1; i <= n; i++)
			printf("%lld%s", ask1(1, i), i == n ? "\n" : " ");
	}
	return 0;
}