hdu 4893 Wow! Such Sequence! 线段树单点更新+区间更新+区间查询

比赛的时候不会做。。区间更新不是整体更新，不知道该怎么处理了。。懒惰标记法也不是很清楚怎么用的。。还有很多需要学习的地方。。

这题很好的体现了lazy_tag的思想，当要增加的区间覆盖当前区间，则直接打上标记返回，当下次查询这个区间儿子区间的时候，直接标记往下传。可以想象，这个标记表示的是这个区间表示的整个区间的标记是整个子树的性质，当你不需要用到这个区间的儿子区间的时候，你可以不把操作都做到底，而是要用到的时候再往下传！

下面是小建建学长的代码：

//1312MS	4668K
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long ll;

const int M=90;
const int N=100005;
ll f[100],sum[N<<2],need[N<<2];
bool lazy[N<<2];

inline ll Find(ll x){
    if(x<=1) return 1;
    int id=lower_bound(f,f+M,x)-f;
    if(x-f[id-1]<=f[id]-x) return f[id-1];
    return f[id];
}

inline void push_up(int t){
    int L = t<<1, R = t<<1 | 1;
    sum[t]=sum[L]+sum[R];
    need[t]=need[L]+need[R];
}

inline void push_down(int t){
    if(lazy[t]){
        int L = t<<1, R = t<<1 | 1;
        lazy[L]=lazy[R]=1;
        sum[L]+=need[L];
        sum[R]+=need[R];
        need[L]=need[R]=0;
        lazy[t]=0;
    }
}

inline void build(int t,int l,int r){
    sum[t]=0;lazy[t]=0;
    need[t]=(r-l+1);
    if(l!=r){
        int mid = (l+r)>>1;
        int L = t<<1, R = t<<1 | 1;
        build(L,l,mid);
        build(R,mid+1,r);
    }
}

inline void add(int t,int l,int r,int x,ll v){
    if(l==r){
        sum[t]+=v;
        need[t]=Find(sum[t])-sum[t];
        return;
    }
    push_down(t);
    int mid = (l+r)>>1, L = t<<1, R = t<<1 | 1;
    if(x<=mid) add(L,l,mid,x,v);
    else add(R,mid+1,r,x,v);
    push_up(t);
}

inline void change(int t,int l,int r,int x,int y){
    if(l>=x && r<=y){
        lazy[t]=1;
        sum[t]+=need[t];
        need[t]=0;
        return;
    }
    push_down(t);
    int mid = (l+r)>>1, L = t<<1, R = t<<1 | 1;
    if(y<=mid) change(L,l,mid,x,y);
    else if(x>mid) change(R,mid+1,r,x,y);
    else{
        change(L,l,mid,x,mid);
        change(R,mid+1,r,mid+1,y);
    }
    push_up(t);
}

inline ll query(int t,int l,int r,int x,int y){
    if(l>=x && r<=y) return sum[t];
    push_down(t);
    int mid = (l+r)>>1, L = t<<1, R = t<<1 | 1;
    if(y<=mid) return query(L,l,mid,x,y);
    else if(x>mid) return query(R,mid+1,r,x,y);
    else return query(L,l,mid,x,mid)+query(R,mid+1,r,mid+1,y);
}

int n,m;
int op,x,y;
int main(){
    f[0]=f[1]=1;
    for(int i=2; i<=M; i++) f[i]=f[i-1]+f[i-2];
    while(~scanf("%d%d",&n,&m)){
        build(1,1,n);
        while(m--){
            scanf("%d%d%d", &op, &x, &y);
            if(op==1) add(1,1,n,x,(ll)y);
            else if(op==3) change(1,1,n,x,y);
            else cout<<query(1,1,n,x,y)<<endl;
        }
    }
    return 0;
}

下面是我整理的标程：

//1359MS	4692K
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define lch(x) ((x)<<1)
#define rch(x) ((x)<<1 | 1)

using namespace std;
typedef long long ll;

ll Fib[92];
ll Sum[444444];
ll FibSum[444444];
bool fibnization[444444];

ll nearest_fibonacci(ll x){
    int where = lower_bound(Fib, Fib+92, x) - Fib;
    if(where && abs(Fib[where-1] - x) <= abs(Fib[where] - x)) return Fib[where-1];
    else return Fib[where];
}

void seg_init(int tl, int tr, int t){
    if(tl == tr){
        Sum[t] = 0;
        FibSum[t] = 1;
        fibnization[t] = false;
        return;
    }
    int mid = (tl+tr)>>1;
    seg_init(tl, mid, lch(t));
    seg_init(mid+1, tr, rch(t));
    Sum[t] = Sum[lch(t)] + Sum[rch(t)];
    FibSum[t] = FibSum[lch(t)] + FibSum[rch(t)];
    fibnization[t] = false;
}

void seg_pushdown(int tl, int tr, int t){
    if(tl == tr) return;
    if(fibnization[t]){
        Sum[lch(t)] = FibSum[lch(t)];
        Sum[rch(t)] = FibSum[rch(t)];
        fibnization[lch(t)] = fibnization[rch(t)] = true;
        fibnization[t] = false;
    }
}

void seg_modify(int x, int delta, int tl, int tr, int t){
    seg_pushdown(tl, tr, t);
    if(tl == tr && tl == x){
        Sum[t] += delta;
        FibSum[t] = nearest_fibonacci(Sum[t]);
        return;
    }
    int mid = (tl+tr)>>1;
    if(x <= mid) seg_modify(x, delta, tl, mid, lch(t));
    else seg_modify(x, delta, mid+1, tr, rch(t));
    Sum[t] = Sum[lch(t)] + Sum[rch(t)];
    FibSum[t] = FibSum[lch(t)] + FibSum[rch(t)];
}

ll seg_query(int l, int r, int tl, int tr, int t){
    if(l <= tl && tr <= r) return Sum[t];
    seg_pushdown(tl,tr,t);
    int mid = (tl+tr)>>1;
    ll ans = 0;
    if(l <= mid) ans += seg_query(l, r, tl, mid, lch(t));
    if(r > mid) ans += seg_query(l,r, mid+1, tr, rch(t));
    return ans;
}

void seg_fib(int l,int r,int tl,int tr,int t){
    if(l <= tl && tr <= r){
        Sum[t] = FibSum[t];
        fibnization[t] = true;
        return;
    }
    seg_pushdown(tl,tr,t);
    int mid = (tl+tr)>>1;
    if(l <= mid) seg_fib(l, r, tl, mid, lch(t));
    if(mid+1 <= r) seg_fib(l, r, mid+1, tr, rch(t));
    Sum[t] = Sum[lch(t)] + Sum[rch(t)];
    FibSum[t] = FibSum[lch(t)] + FibSum[rch(t)];
}

int main(){
    Fib[0] = Fib[1] = 1;
    for(int i = 2;i < 92;i++) Fib[i] = Fib[i-1] + Fib[i-2];
    int n, m;
    while(~scanf("%d%d", &n, &m)){
        seg_init(1, n, 1);
        while(m--){
            int type;
            scanf("%d", &type);
            if(type == 1){
                int x, delta;
                scanf("%d%d", &x, &delta);
                seg_modify(x, delta, 1, n, 1);
            } else if(type == 2){
                int l, r;
                scanf("%d%d", &l, &r);
                printf("%I64d\n", seg_query(l, r, 1, n, 1));
            } else {
                int l, r;
                scanf("%d%d", &l, &r);
                seg_fib(l, r, 1, n, 1);
            }
        }
    }
    return 0;
}