H - Skyscraper Gym - 102220H(线段树)

这个区间合并的一个骚操作（tr[m].sum = tr[m << 1].sum + tr[m << 1 | 1].sum - min(tr[m << 1].rx, tr[m << 1 | 1].lx);//类似query的操作）
很值得学习，l就是左边的高度，r最右边高度，sum就是这个区间的答案，lazy标记，总之这题出的很不错~~
当然，树状数组也可以做，还比较简洁，不过还没学，下次补上~~~~

#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

typedef long long ll;
const int N = 1e5 + 20;

struct node{
	ll lazy, lx, rx, sum;
} tr[N << 2];
void pushup(int m){
	tr[m].sum = tr[m << 1].sum + tr[m << 1 | 1].sum - min(tr[m << 1].rx, tr[m << 1 | 1].lx);//类似query的操作
	tr[m].lx = tr[m << 1].lx;//左端点
	tr[m].rx = tr[m << 1 | 1].rx;//右端点
}

void pushdown(int m){
	if (tr[m].lazy)	{
		ll t = tr[m].lazy;
		tr[m].lazy = 0;

		tr[m << 1].lazy+=t;
		tr[m << 1].sum+=t;
		tr[m << 1].lx+=t;
		tr[m << 1].rx+=t;

		tr[m << 1|1].lazy += t;
		tr[m << 1|1].sum += t;
		tr[m << 1|1].lx += t;
		tr[m << 1|1].rx += t;
	}
}

void build(int m, int l, int r){
	tr[m].lazy = 0;
	if (l == r)	{
		scanf("%d", &tr[m].sum);
		tr[m].lx = tr[m].rx = tr[m].sum;
		return;
	}
	int mid = (l + r) >> 1;

	build(m << 1, l, mid);
	build(m << 1 | 1, mid + 1, r);

	pushup(m);
}

void update(int m, int l, int r,int a,int b, ll v){
	if (a <= l && r <= b) {
		tr[m].lazy += v;
		tr[m].sum += v;
		tr[m].lx += v;
		tr[m].rx += v;
		return;
	}
	pushdown(m);
	int mid = (l+r) >> 1;
	
	if (a <= mid)update(m << 1, l, mid, a, b ,v);
	if (b > mid)update(m << 1 | 1, mid + 1, r, a, b, v);
	pushup(m);
}

ll query(int m, int l,int r,int a, int b)
{
	if (a <= l && r <= b) return tr[m].sum;
	pushdown(m);
	int mid = (l + r) >> 1;
	//  区间分左右 断层的地方需要特殊考虑 如更新3~4 询问3~4 
	//  要不全在左 要不全在右 否则 区间合并的时候有一个贡献(模拟一下你就明白）
	if (b <= mid)	
		return query(m << 1,l,mid, a, b);
	if (a > mid)
		return query(m << 1 | 1, mid + 1, r, a, b);
	return query(m << 1, l, mid, a, b) + query(m << 1 | 1, mid + 1, r, a, b) - min(tr[m << 1].rx, tr[m << 1 | 1].lx);
}

int main(){
	int T, n, m, op, l, r;
	ll k;
	scanf("%d", &T);
	while (T--)	{
		scanf("%d%d", &n, &m);
		build(1, 1, n);
		while (m--)		{
			scanf("%d", &op);
			if (op == 1)			{
				scanf("%d%d%lld", &l, &r, &k);
				update(1,1,n, l, r, k);
			}
			else	{
				scanf("%d%d", &l, &r);
				printf("%lld\n", query(1, 1, n, l, r));
			}
		}
	}
	return 0;
}