CF 444C DZY Loves Colors

线段树,lazy。三个变量，col, sum, add。add为lazy标志，sum为区间总颜色值,col为区间颜色，仅当区间内颜色都一样时不为零。

第一次写pushdown时,col没更新，add的值不是增加而是赋值WA一发。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define N 100005
#define mod 20140518
#define inf 1 << 29;
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
typedef long long LL;
LL sum[N << 2], col[N << 2], add[N << 2];
void build(int l, int r, int rt){
    sum[rt] = 0;
    col[rt] = 0;
    add[rt] = 0;
    if(l == r){
        col[rt] = l;
        return ;
    }
    int m = (l + r) >> 1;
    build(lson);
    build(rson);
}
void pushdown(int l, int r, int rt){
    if(add[rt]){
        int m = (l + r) >> 1;
        add[rt << 1] += add[rt];
        add[rt << 1 | 1] += add[rt];
        sum[rt << 1] += (m - l + 1) * add[rt];
        sum[rt << 1 | 1] += (r - m) * add[rt];
        add[rt] = 0;
        if(col[rt] != 0){
            col[rt << 1] = col[rt];
            col[rt << 1 | 1] = col[rt];
        }
    }
}
void pushup(int rt){
    sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];
    if(col[rt << 1] == col[rt << 1 | 1] && col[rt << 1] != 0)col[rt] = col[rt << 1];
    else col[rt] = 0;
}
void update(int L, int R, LL val, int l, int r, int rt){
    if(L <= l && R >= r && col[rt] != 0){
        add[rt] += abs(val - col[rt]);
        sum[rt] += (LL)(r - l + 1) * abs(val - col[rt]);
        col[rt] = val;
        return;
    }
    int m = (l + r) >> 1;
    pushdown(l, r, rt);
    if(L <= m)update(L, R, val, lson);
    if(R > m)update(L, R, val, rson);
    pushup(rt);
}
LL query(int L, int R, int l, int r, int rt){
    if(L <= l && R >= r){
        return sum[rt];
    }
    int m = (l + r) >> 1;
    pushdown(l, r, rt);
    LL ans = 0;
    if(L <= m)ans += query(L, R, lson);
    if(R > m)ans += query(L, R, rson);
    return ans;
}
int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    build(1, n, 1);
    LL x, y, z, a;
    while(m--){
        scanf("%I64d", &a);
        if(a == 1){
            scanf("%I64d%I64d%I64d", &x, &y, &z);
            update(x, y, z, 1, n, 1);
        }
        else {
            scanf("%I64d%I64d", &x, &y);
            printf("%I64d\n", query(x, y, 1, n, 1));
        }
    }
    return 0;
}