前大半部分关于解决点在树上的做法并不是我研究的。Orz SYR and JYG.
这里仅讨论如果我们得到环上每个点往下最多能走的深度 f [ u ] f[u] f[u],怎么计算在环上的每个点所能获得的最长路径。
在环上走有两种情况,我们可以分别考虑。第一种是路径没有跨过[0,n-1]这条边:对于编号为
i
i
i的节点,该路径只可能是从
[
0
,
i
]
[0,i]
[0,i]的一个节点出发走到
[
i
+
1
,
n
−
1
]
[i+1,n-1]
[i+1,n−1]的一个节点,或者从
[
0
,
i
−
1
]
[0,i-1]
[0,i−1]中的一个节点出发走到
[
i
,
n
−
1
]
[i,n-1]
[i,n−1]中的一个节点(区别在于i号节点本身是入点还是出点)。
所以我们只需要分别求出作为入点的前缀最大值和作为出点的后缀最大值即可。
对于跨过了 [ 0 , n − 1 ] [0,n-1] [0,n−1]这条边的路径,我们有两种跨越方式:从0走到n-1,或者从n-1走到0。对于从0走到n-1的方式,我们从小往大遍历,记录前缀最大出点价值以及最长总路径值。对于n-1走到0的方式,我们从大往小遍历。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n;
int vis[maxn], ban[maxn], deg[maxn];
int f[maxn], g[maxn], h[maxn], ans[maxn];
vector<int> cycle;
vector<int> tree[maxn];
inline void clear(){
for (int i = 0; i < n; ++i) {
tree[i].clear();
vis[i] = 0;
deg[i] = 0;
ban[i] = 0;
f[i] = g[i] = h[i] = ans[i] = 0;
}
cycle.clear();
}
inline void findCycle(){
queue<int> que;
for (int i = 0; i < n; ++i) if (deg[i] == 1) que.push(i);
while(!que.empty()) {
int u = que.front(); que.pop();
vis[u] = 1;
for (auto v: tree[u]) if ((--deg[v]) == 1) que.push(v);
}
for (int u = 0; u < n; ++u) if (!vis[u]) {
for (; !vis[u]; ) {
ban[u] = 1;
vis[u] = 1;
cycle.push_back(u);
for (auto v: tree[u]) if (!vis[v]) {
u = v;
break;
}
}
}
}
inline void calcF(int u, int p) {
for (auto v: tree[u]) if (v != p && !ban[v]) {
calcF(v, u);
f[u] = max(f[v] + 1, f[u]);
}
}
inline void calcCycle(){
int L = cycle.size();
for (int i = 0; i < L; ++i) {
cycle.push_back(cycle[i]);
}
deque<int> que;
for (int i = 0; i < L * 2; ++i) {
while (i - que.front() >= L) que.pop_front();
if (que.size()) {
g[cycle[i]] = max(g[cycle[i]], i + f[cycle[que.front()]] - que.front());
}
while (que.size() && f[cycle[i]] - i >= f[cycle[que.back()]] - que.back()) que.pop_back();
que.push_back(i);
}
reverse(cycle.begin(), cycle.end());
que.clear();
for (int i = 0; i < L * 2; ++i) {
while (i - que.front() >= L) que.pop_front();
if (que.size()) {
g[cycle[i]] = max(g[cycle[i]], i + f[cycle[que.front()]] - que.front());
}
while (que.size() && f[cycle[i]] - i >= f[cycle[que.back()]] - que.back()) que.pop_back();
que.push_back(i);
}
for (int i = 0; i < L; ++i) cycle.pop_back();
}
inline void calcG(int u, int p){
int mx = g[u] + 1;
for (int i = 0; i < tree[u].size(); ++i) if (tree[u][i] != p && !ban[tree[u][i]]) {
int v = tree[u][i];
g[v] = max(g[v], mx);
mx = max(mx, f[v] + 2);
}
mx = g[u] + 1;
for (int i = (int) tree[u].size() - 1; i >= 0; --i) if (tree[u][i] != p && !ban[tree[u][i]]) {
int v = tree[u][i];
g[v] = max(g[v], mx);
mx = max(mx, f[v] + 2);
calcG(v, u);
}
}
inline void calcAns(int u, int p) {
int mx1 = 0, mx2 = 0;
for (auto v: tree[u]) if (v != p && !ban[v]) {
calcAns(v, u);
if (f[v] > mx1) mx2 = mx1, mx1 = f[v];
else if (f[v] > mx2) mx2 = f[v];
}
//if(u==0){printf("%d %d\n",mx1,mx2);}
ans[u] = max(ans[u], mx1 + mx2+2);
ans[u] = max(ans[u], f[u] + g[u]);
}
struct node{
int val,id;
node(int _val=0,int _id=0){val=_val;id=_id;}
}v1[maxn<<1],v2[maxn<<1];
int id[maxn<<1],suf[maxn<<1],pre[maxn<<1];
inline void solve() {
scanf("%d", &n);
clear();
for (int i = 0; i < n; ++i) {
int u, v; scanf("%d%d", &u, &v);
--u, --v;
tree[u].push_back(v);
tree[v].push_back(u);
++deg[u], ++deg[v];
}
findCycle();
// puts("cycle");
// for (auto u: cycle) printf("%d ", u);
// puts("");
for (auto u: cycle) calcF(u, -1);
calcCycle();
for (auto u: cycle) calcG(u, -1);
/*
Nodes on the cycle are in `std::vector<int> cycle` with ban[u] = 1
f[u] is the weight on each node (when chosen as endpoints)
Store the result in h[u]
*/
int len=cycle.size();
for(int i=0;i<len;i++)id[i]=cycle[i];
pre[0]=suf[len+1]=-(1<<29);
for(int i=1;i<=len;i++)
pre[i]=max(pre[i-1],f[id[i-1]]-i);
for(int i=len;i>=1;i--)
suf[i]=max(suf[i+1],f[id[i-1]]+i);
for(int i=1;i<=len;i++)
h[id[i-1]]=max({h[id[i-1]],pre[i]+suf[i+1],pre[i-1]+suf[i]});
//max(a_i+i+a_j-j+n), cross the 0 - (n-1) edge.
int mxi=-(1<<29),mxj=-(1<<29);
//from 0 to n-1
for(int i=0;i<len;i++){
mxj=max(mxj,mxi+f[id[i]]-i+len);
mxi=max(mxi,f[id[i]]+i);
h[id[i]]=max(h[id[i]],mxj);
}
mxi=mxj=-(1<<29);
// from n-1 to 0
for(int i=len-1;i>=0;i--){
mxj=max(mxj,mxi+f[id[i]]+i+len);
mxi=max(mxi,f[id[i]]-i);
h[id[i]]=max(h[id[i]],mxj);
}
for (auto u: cycle) {
ans[u] = h[u];
calcAns(u, -1);
}
// for (int u = 0; u < n; ++u) printf("%d ", f[u]); puts("");
// for (int u = 0; u < n; ++u) printf("%d ", g[u]); puts("");
// for (int u = 0; u < n; ++u) printf("%d ", h[u]); puts("");
for (int u = 0; u < n; ++u) printf("%d ", ans[u]);
puts("");
}
int main(){
int T;
for (scanf("%d", &T); T--; solve());
return 0;
}