C - DZY Loves Colors（线段树区间修改好题）

http://codeforces.com/contest/444/problem/C

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int maxn = 1e5 + 100;
int n, m;
struct Tree {
	int l, r;
	ll sum, col, lz;
	void update(ll v) {
		sum += v * (r - l + 1);
		lz += v;
	}
} tr[maxn << 2];

void push_down(int o) {
	if(tr[o].col) {
		tr[o<<1].update(tr[o].lz);
		tr[o<<1|1].update(tr[o].lz);
		tr[o<<1|1].col = tr[o<<1].col = tr[o].col;
		tr[o].col = 0;
		tr[o].lz = 0;
	}
}
void push_up(int o) {
	tr[o].sum = tr[o<<1].sum + tr[o<<1|1].sum;
	if(tr[o<<1|1].col == tr[o<<1].col) {
		tr[o].col = tr[o<<1].col;
	}
	else tr[o].col = 0;
}
void build(int o, int l, int r) {
	tr[o].l = l, tr[o].r = r;
	tr[o].col = tr[o].sum = 0;
	if(l == r) {
		tr[o].col = l;
		return ;
	}
	int mid = (l + r) / 2;
	build(o<<1, l, mid);
	build(o<<1|1, mid + 1, r);
}

void modify(int o, int l, int r, int c) {
	int L = tr[o].l, R = tr[o].r;
	if(l <= L && R <= r) {
		if(tr[o].col) {
			tr[o].sum += (ll)abs(c - tr[o].col) * (R - L + 1);
			tr[o].lz += abs(c - tr[o].col);
			tr[o].col = c;
			return ;
		}
	}
	push_down(o);
	int mid = (R + L) / 2;
	if(mid >= l) modify(o<<1, l, r, c);
	if(mid < r) modify(o<<1|1, l, r, c);
	push_up(o);
}

ll query(int o, int l, int r) {
	int L = tr[o].l, R = tr[o].r;
	if(l <= L && R <= r) {
		return tr[o].sum;
	}
	push_down(o);
	int mid = (L + R) / 2;
	ll ret = 0;
	if(mid >= l) ret += query(o<<1, l, r);
	if(mid < r) ret += query(o<<1|1, l, r);
	return ret;
}

void prt(int o) {
	cout << "[" << tr[o].l << ", " << tr[o].r << "]" << ": " << tr[o].sum << endl;
	if(tr[o].l == tr[o].r) return ;
	prt(o<<1);
	prt(o<<1|1); 
}

int main()
{

	// freopen("/Users/maoxiangsun/MyRepertory/acm/code/i.txt", "r", stdin);
	scanf("%d%d", &n, &m);
	build(1, 1, n);
	// prt(1);
	while(m--) {
		int op;
		scanf("%d", &op);
		if(op == 1) {
			int l, r, c;
			scanf("%d%d%d", &l, &r, &c);
			modify(1, l, r, c);   
			// prt(1);

		}
		else {
			int l, r;
			scanf("%d%d", &l, &r);
			printf("%lld\n", query(1, l, r));
		}
	}
    return 0;
}

/*
3 3
1 1 2 4
1 2 3 5
2 1 3
*/