ACWing 355 异象石

结论：将一棵树中给定的点全部链接起来的最小代价的求法

         求出每个节点的dfs序，形成一个环形，求环上相邻两点的距离之和即为答案的2倍。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
const int maxm = 200005;
typedef long long LL;
typedef pair<int,int> pii;
int tot,ver[maxm],ne[maxm],he[maxn];
LL cost[maxm];
void add( int x,int y,LL z ){
    ver[++tot]=  y;
    ne[tot] = he[x];
    he[x] = tot;
    cost[tot] = z;
}
int st[maxn],fa[maxn][21],d[maxn];
LL dis[maxn];
int tim;
void dfs( int x,int f ){
    st[x] = ++tim;
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y = ver[cure];
        if( y == f ) continue;
        dis[y] = dis[x]+cost[cure];
        d[y] = d[x]+1;
        fa[y][0] = x;
        for( int i = 1;i <= 20;i++){
            fa[y][i] = fa[fa[y][i-1]][i-1];
        }
        dfs(y,x);
    }
}
int lca( int x,int y ){
    if( d[y] > d[x] ) swap(x,y);
    for( int i = 20;i >= 0;i-- ){
        if( d[fa[x][i]] >= d[y] ) x = fa[x][i];
    }
    if(x==y) return x;
    for( int i = 20;i >= 0;i-- ){
        if( fa[x][i] != fa[y][i] ){
            x =fa[x][i];
            y = fa[y][i];
        }
    }
    return fa[x][0];
}
LL dist( int x,int y ){
    int z = lca(x,y);
    return dis[x] + dis[y] - 2*dis[z];
}
set<pii> se;
int main(){
    int n;
    scanf("%d",&n);
    LL z;
    for( int x,y,i = 1;i < n;i++ ){
        scanf("%d%d%lld",&x,&y,&z);
        add(x,y,z);add(y,x,z);
    }
    d[1] = 1;
    dfs(1,0);
    int m;
    scanf("%d",&m);
    char str[10];
    LL ans = 0;
    for( int x,i = 1;i <= m;i++ ){
        scanf("%s",str);
        if( str[0] == '+' ){scanf("%d",&x);
            auto p = se.insert( pii(st[x],x) ).first;
            if( se.size() > 1 ) {
                auto le = p;
                if (le != se.begin()) {
                    --le;
                } else {
                    le = se.end();
                    --le;
                }
                auto ri = p;
                ++ri;
                if( ri == se.end() ) ri = se.begin();
                ans -= dist( le->second,ri->second );
                ans += dist( le->second,p->second ) + dist( p->second,ri->second );
            }
        }else if( str[0]=='-' ){scanf("%d",&x);
            auto p = se.find( pii(st[x],x) );
            if( se.size() > 1 ){
                auto le = p;
                if (le != se.begin()) {
                    --le;
                } else {
                    le = se.end();
                    --le;
                }
                auto ri = p;
                ++ri;
                if( ri == se.end() ) ri = se.begin();
                ans += dist( le->second,ri->second );
                ans -= dist( le->second,p->second ) + dist( p->second,ri->second );
            }
            se.erase( pii(st[x],x) );
        }
        else printf("%lld\n",ans/2);
    }
    return 0;
}