HYSBZ - 1036 树的统计Count（树链剖分）

点我看题

题意：中文题题意很明显。

分析：树链剖分+线段树维护区间最大值及区间和。

另外发现了一个问题，对于树上点而非边的树剖，在find函数里面，如果u==v，也不要直接返回，还得进一步查询，如果是边的话，毫无疑问直接返回了，因为两个重点之间没边。

//空调吹感冒了= =（头晕嗓子疼= =

参考代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>

using namespace std;
#define inf 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a))
#define lson rt<<1
#define rson rt<<1|1
const int maxn = 3e4+10;
int n,q;
//int e[maxn][2];
int head[maxn],tot;
struct Edge{
    int to,next;
}edge[maxn<<1];
int a[maxn];
int siz[maxn],fa[maxn],son[maxn],dep[maxn];
int p[maxn],fp[maxn],top[maxn],poi;
//线段树
int mx[maxn<<2],sum[maxn<<2];

void Init()
{
    tot = poi = 0;
    mem(head,-1);
    mem(son,-1);
}

void AddEdge(int u, int v)
{
    edge[tot].to = v;
    edge[tot].next = head[u];
    head[u] = tot++;
}

void dfs1( int u, int pre, int d)
{
    siz[u] = 1;
    fa[u] = pre;
    dep[u] = d;
    for( int i = head[u]; ~i; i = edge[i].next)
    {
        int v = edge[i].to;
        if( v != pre)
        {
            dfs1(v,u,d+1);
            siz[u] += siz[v];
            if( son[u] == -1 || siz[v] > siz[son[u]])
                son[u] = v;
        }

    }
}

void dfs2( int u, int tp)
{
    top[u] = tp;
    p[u] = ++poi;
    fp[p[u]] = u;
    if( son[u] == -1)
        return;
    dfs2(son[u],tp);
    for( int i = head[u]; ~i; i = edge[i].next)
    {
        int v = edge[i].to;
        if( v != fa[u] && v != son[u])
            dfs2(v,v);
    }
}

void PushUp( int rt)
{
    mx[rt] = max(mx[lson],mx[rson]);
    sum[rt] = sum[lson]+sum[rson];
}

void Build( int l, int r, int rt)
{
    mx[rt] = -inf;
    sum[rt] = 0;
    if( l == r)
    {
        mx[rt] = a[fp[l]];
        sum[rt] = a[fp[l]];
        return;
    }
    int mid = (l+r)>>1;
    Build(l,mid,lson);
    Build(mid+1,r,rson);
    PushUp(rt);
}

//单点更新
void Update( int l, int r, int rt, int pos, int val)
{
    if( l == pos && r == pos)
    {
        mx[rt] = val;
        sum[rt] = val;
        return;
    }
    int mid = (l+r)>>1;
    if( pos <= mid)
        Update(l,mid,lson,pos,val);
    else
        Update(mid+1,r,rson,pos,val);
    PushUp(rt);
}

int QueryMax( int l, int r, int rt, int L, int R)
{
    if( l == L && r == R)
        return mx[rt];
    int ans = -inf;
    int mid = (l+r)>>1;
    if( R <= mid)
        ans = max(ans,QueryMax(l,mid,lson,L,R));
    else if( L > mid)
        ans = max(ans,QueryMax(mid+1,r,rson,L,R));
    else
        ans = max(ans,max(QueryMax(l,mid,lson,L,mid),QueryMax(mid+1,r,rson,mid+1,R)));
    return ans;
}

int QuerySum( int l, int r, int rt, int L, int R)
{
    if( l == L && r == R)
        return sum[rt];
    int ans = 0;
    int mid = (l+r)>>1;
    if( R <= mid)
        ans += QuerySum(l,mid,lson,L,R);
    else if( L > mid)
        ans += QuerySum(mid+1,r,rson,L,R);
    else
        ans += QuerySum(l,mid,lson,L,mid)+QuerySum(mid+1,r,rson,mid+1,R);
    return ans;
}

int FindMax( int u, int v)
{
    int ans = -inf;
    int t1 = top[u];
    int t2 = top[v];
    while( t1 != t2)
    {
        if( dep[t1] < dep[t2])
        {
            swap(u,v);
            swap(t1,t2);
        }
        ans = max(ans,QueryMax(1,poi,1,p[t1],p[u]));
        u = fa[t1];
        t1 = top[u];
    }
    if( dep[u] > dep[v])
        swap(u,v);
    ans = max(ans,QueryMax(1,poi,1,p[u],p[v]));
    return ans;
}

int FindSum( int u, int v)
{
    int ans = 0;
    int t1 = top[u];
    int t2 = top[v];
    while( t1 != t2)
    {
        if( dep[t1] < dep[t2])
        {
            swap(u,v);
            swap(t1,t2);
        }
        ans += QuerySum(1,poi,1,p[t1],p[u]);
        u = fa[t1];
        t1 = top[u];
    }
    if( dep[u] > dep[v])
        swap(u,v);
    ans += QuerySum(1,poi,1,p[u],p[v]);
    return ans;
}

int main()
{
    while( ~scanf("%d",&n))
    {
        Init();
        int u,v;
        for( int i = 1; i < n; i++)
        {
            scanf("%d%d",&u,&v);
            AddEdge(u,v);
            AddEdge(v,u);
        }
        dfs1(1,0,0);
        dfs2(1,1);
        for( int i = 1; i <= n; i++)
            scanf("%d",&a[i]);
        Build(1,poi,1);

        scanf("%d",&q);
        while( q--)
        {
            char op[10];
            scanf("%s%d%d",op,&u,&v);
            if( op[1] == 'H')
                Update(1,poi,1,p[u],v);
            else if( op[1] == 'M')
                printf("%d\n",FindMax(u,v));
            else if( op[1] == 'S')
                printf("%d\n",FindSum(u,v));
        }
    }

    return 0;
}