HDU 6162 Ch’s gift （树链剖分+线段树维护）

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int maxn=1e5+100;
const int lz=0;
const ll INF=1e18;
///存图
vector<int> g[maxn];
///线段树结构
int n,w[maxn],val[maxn],m,lb,ub;
    int minv[maxn<<2],maxv[maxn<<2];///左右值
    ll sum[maxn<<2];
    void pushup(int x){
        sum[x]=sum[x<<1]+sum[x<<1|1];
        minv[x]=min(minv[x<<1],minv[x<<1|1]);
        maxv[x]=max(maxv[x<<1],maxv[x<<1|1]);
    }
    void build(lrt){
        if(l==r) {sum[rt]=minv[rt]=maxv[rt]=w[l];return;}
        int mid=l+r>>1;
        build(lson),build(rson),pushup(rt);
    }
    ll query(lrt,int L,int R){
        if(minv[rt]>ub||maxv[rt]<lb) return 0LL;
        if(L<=l&&r<=R) if(minv[rt]>=lb&&maxv[rt]<=ub) return sum[rt];
        int mid=l+r>>1;
        ll ans=0;
        if(L<=mid) ans+=query(lson,L,R);
        if(mid<R) ans+=query(rson,L,R);
        return ans;
    }
///第一次dfs
int fa[maxn],dep[maxn],sz[maxn],son[maxn];
void dfs1(int u,int f){
    sz[u]=1,fa[u]=f,dep[u]=dep[f]+1;
    rep(i,0,g[u].size()){
        int v=g[u][i];
        if(v==f) continue;
        dfs1(v,u);
        sz[u]+=sz[v];
        if(sz[v]>sz[son[u]]) son[u]=v;
    }
}
///第二次dfs
int tim,dfn[maxn],top[maxn];
void dfs2(int u,int f){///这里的f是top的意思
    dfn[u]=++tim,top[u]=f,w[tim]=val[u];
    if(son[u]) dfs2(son[u],f);
    rep(i,0,g[u].size()){
        int v=g[u][i];
        if(v==fa[u]||v==son[u]) continue;/坑点
        dfs2(v,v);
    }
}
ll query(int x,int y){
    ll ans=0;
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        ans+=query(1,n,1,dfn[top[x]],dfn[x]);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    ans+=query(1,n,1,dfn[x],dfn[y]);
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    /*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    while(cin>>n>>m){
        rep(i,1,n+1){
            g[i].clear();
            top[i]=fa[i]=son[i]=sz[i]=dep[i]=0;
        }
        rep(i,1,n+1) cin>>val[i];
        rep(i,1,n){
            int x,y;
            cin>>x>>y;
            g[x].push_back(y);
            g[y].push_back(x);
        }
        
        tim=0;
        dfs1(1,0);
        dfs2(1,1);
        build(1,n,1);
        while(m--){
            int x,y;
            cin>>x>>y>>lb>>ub;
            cout<<query(x,y);
            if(m) cout<<" ";
        }
        cout<<"\n";
    }
    return 0;
}