题目大意:给你一堆基环树,求这些基环树的直径和。
题解:求基环树的直径:按直径是否经过环分类讨论:对于不经过环的直径,就是环上的点为根节点所在的子树的直径,取最大值。经过环的直径:显然要求出环上每一个点到它的子树里的点的最远距离 d i s dis dis。将环复制一倍展开,然后枚举环上每一个点 u u u作为终点,用单调队列优化找出 d i s v − s u m v dis_v - sum_v disv−sumv的最大值,更新 a n s = m a x ( a n s , d i s u + d i s v + s u m u − s u m v ) ans = max(ans,dis_u + dis_v + sum_u - sum_v) ans=max(ans,disu+disv+sumu−sumv), s u m sum sum为环上边权的前缀和。
(恶心的是这题把递归的做法卡掉了,蒟蒻写不动了,只有递归版的代码,待补)
递归扣环:
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fir first
#define sec second
const int maxn = 1e6 + 10;
vector<pii> g[maxn];
typedef long long ll;
int pot[2 * maxn],w[2 * maxn],cnt,dfn[maxn],sz;
ll dp[maxn][2];
int vis[maxn],d[maxn],f[maxn];
int n;
ll q[2 * maxn],sum[2 * maxn];
int id[2 * maxn],top,rear;
void dfs(int u,int wi,int fa) {
dfn[u] = ++sz;
bool t = false;
for(int i = 0; i < g[u].size(); i++) {
int v = g[u][i].fir,val = g[u][i].sec;
if(v == fa && val == wi && !t) {
t = true;
continue;
}
if(!dfn[v]) {
d[v] = val;
f[v] = u;
dfs(v,val,u);
}
else if(dfn[v] < dfn[u]) continue;
else if(dfn[v] > dfn[u]) {
for(int p = v; p != u; p = f[p]) { //边权要对应存,所以要移动一位
pot[++cnt] = p;
w[cnt + 1] = d[p];
}
pot[++cnt] = u;
w[1] = val;
continue;
}
}
}
void dfs2(int u,int fa,ll &ans) {
dp[u][0] = dp[u][1] = 0;
for(int i = 0; i < g[u].size(); i++) {
int v = g[u][i].fir,val = g[u][i].sec;
if(v == fa || vis[v]) continue;
dfs2(v,u,ans);
if(dp[v][0] + val > dp[u][0]) {
dp[u][1] = dp[u][0];
dp[u][0] = dp[v][0] + val;
}
else if(dp[v][0] + val > dp[u][1]) {
dp[u][1] = dp[v][0] + val;
}
}
ans = max(ans,dp[u][0] + dp[u][1]);
}
int main() {
scanf("%d",&n);
for(int i = 1; i <= n; i++) {
int u,v;
scanf("%d%d",&u,&v);
g[i].push_back(pii(u,v));
g[u].push_back(pii(i,v));
}
ll res = 0,ans = 0;
for(int i = 1; i <= n; i++) {
if(!dfn[i]) {
ans = cnt = 0;dfs(i,0,0);
sum[0] = top = rear = 0;
for(int i = 1; i <= cnt; i++) vis[pot[i]] = 1;
for(int i = 1; i <= cnt; i++)
pot[i + cnt] = pot[i],w[i + cnt] = w[i];
for(int i = 1; i <= cnt; i++)
dfs2(pot[i],0,ans);
for(int i = 1; i <= 2 * cnt; i++)
sum[i] = sum[i - 1] + w[i];
int cur = 1;
for(int i = 1; i <= 2 * cnt; i++) {
while(cur < i) {
while(rear > top && q[rear] <= dp[pot[cur]][0] - sum[cur]) rear--;
q[++rear] = dp[pot[cur]][0] - sum[cur];
id[rear] = cur;
while(top < rear && id[top + 1] < i - cnt + 1) top++;
cur++;
}
if(top < rear && id[top + 1] != i)
ans = max(ans,q[top + 1] + dp[pot[i]][0] + sum[i]);
}
res += ans;
}
}
printf("%lld\n",res);
return 0;
}