POJ3237 Tree

这题同样需要将边权转换成点权。
题目链接
另一道需要将边权转换成点权的题

#include<iostream>
#include<cstdio>
using namespace std;
int n,tot,label,tree[80010],Next[20010],head[10010],tree1[20010],val[20010],num[20010],dep[10010];
int top[10010],tid[10010],edge[10010],fa[10010],son[10010],size[10010],a[10010],flag[10010];
bool visit[10010];
void swap(int &x,int &y)
{
    int t=x;x=y;y=t;
}
int max(int i,int j)
{
    if (i>j) return i;else return j;
}
void Add(int x,int y,int z,int number)
{
    tot++;
    Next[tot]=head[x];
    head[x]=tot;
    tree1[tot]=y;
    val[tot]=z;
    num[tot]=number;
}
void build(int id,int l,int r)
{
    if (l==r)
    {
        tree[id]=a[flag[l]];
        return;
    }
    int mid=(l+r)/2;
    build(id*2,l,mid);
    build(id*2+1,mid+1,r);
    tree[id]=max(tree[id*2],tree[id*2+1]);
}
void dfs(int x,int father,int depth)
{
    visit[x]=true;dep[x]=depth;fa[x]=father;son[x]=0;size[x]=1;
    int maxsize=0;
    for (int i=head[x];i;i=Next[i])
    if (!visit[tree1[i]])
    {
        a[tree1[i]]=val[i];edge[num[i]]=tree1[i];
        dfs(tree1[i],x,depth+1);
        size[x]+=size[tree1[i]];
        if (size[tree1[i]]>maxsize)
        {
            maxsize=size[tree1[i]];
            son[x]=tree1[i];
        }
    }
}
void dfs1(int x,int ancestor)
{
    top[x]=ancestor;visit[x]=true;
    label++;tid[x]=label;flag[label]=x;
    if (son[x]!=0) dfs1(son[x],ancestor);
    for (int i=head[x];i;i=Next[i])
        if (!visit[tree1[i]]) dfs1(tree1[i],tree1[i]);
}
void change_it(int x,int y,int d,int id,int l,int r)
{
    if (r<x||l>y) return;
    if (l==r) //此题单点修改值，所以这里x=y 
    {
        tree[id]=d;
        return;
    }
    int mid=(l+r)/2;
    change_it(x,y,d,id*2,l,mid);
    change_it(x,y,d,id*2+1,mid+1,r);
    tree[id]=max(tree[id*2],tree[id*2+1]);
}
void negate_it(int x,int y,int id,int l,int r)
{
    if (r<x||l>y) return;
    if (l==r&&x<=l&&r<=y)
    {
        tree[id]=-tree[id];
        return;
    }
    int mid=(l+r)/2;
    negate_it(x,y,id*2,l,mid);
    negate_it(x,y,id*2+1,mid+1,r);
    tree[id]=max(tree[id*2],tree[id*2+1]);
}
int query_it(int x,int y,int id,int l,int r)
{
    if (r<x||l>y) return -1<<29;
    if (x<=l&&r<=y) return tree[id];
    int mid=(l+r)/2;
    return max(query_it(x,y,id*2,l,mid),query_it(x,y,id*2+1,mid+1,r));
}
void change(int x,int y,int d)
{
    while (top[x]!=top[y])
    {
        if (dep[top[x]]<dep[top[y]]) swap(x,y);
        change_it(tid[top[x]],tid[x],d,1,1,n);
        x=fa[top[x]];
    }
    if (dep[x]>dep[y]) swap(x,y);
    change_it(tid[x],tid[y],d,1,1,n);
}
void negate1(int x,int y)
{
    while (top[x]!=top[y])
    {
        if (dep[top[x]]<dep[top[y]]) swap(x,y);
        negate_it(tid[top[x]],tid[x],1,1,n);
        x=fa[top[x]];
    }
    if (dep[x]>dep[y]) swap(x,y);
    negate_it(tid[x]+1,tid[y],1,1,n);
}
int query(int x,int y)
{
    int ans=-1<<29;
    while (top[x]!=top[y])
    {
        if (dep[top[x]]<dep[top[y]]) swap(x,y);
        ans=max(ans,query_it(tid[top[x]],tid[x],1,1,n));
        x=fa[top[x]];
    }
    if (dep[x]>dep[y]) swap(x,y);
    ans=max(ans,query_it(tid[x]+1,tid[y],1,1,n));
    return ans;
}
int main()
{
    int T;
    scanf("%d",&T);
    for (int cas=1;cas<=T;cas++)
    {
        scanf("%d",&n);
        for (int i=1;i<=n;i++) head[i]=0;
        tot=0;label=0;
        for (int i=1;i<n;i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            Add(x,y,z,i);Add(y,x,z,i);
        }
        for (int i=1;i<=n;i++) visit[i]=false;
        a[1]=-1<<29;
        dfs(1,0,1);
        for (int i=1;i<=n;i++) visit[i]=false;
        dfs1(1,1);
        build(1,1,n);
        char s[10];
        while (true)
        {
            scanf("%s",s);
            if (s[0]=='D') break;
            if (s[0]=='C')
            {
                int x,d;
                scanf("%d%d",&x,&d);
                change(edge[x],edge[x],d);
            }
            if (s[0]=='N')
            {
                int x,y;
                scanf("%d%d",&x,&y);
                negate1(x,y);
            }
            if (s[0]=='Q')
            {
                int x,y;
                scanf("%d%d",&x,&y);
                printf("%d\n",query(x,y));
            }
        }
    }
    return 0;
}