一开始以为是环套树的直径 后来发现不对
其实做法差不多 暴力断开一条边 然后找树直径
这可以在环上建线段树优化
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
inline char nc()
{
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(int &x)
{
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
const int N=100005;
struct point{
ll f; int idx;
point(ll f=-1LL<<60,int idx=0):f(f),idx(idx) { };
bool operator < (const point &B)const{
return f<B.f;
}
};
typedef pair<point,point> abcd;
inline abcd Min(abcd A,abcd B){
if (B.first<A.first)
return abcd(A.first,max(B.first,A.second));
else
return abcd(B.first,max(A.first,B.second));
};
struct SEG{
abcd T[N<<4]; int M;
inline void Build(int n,ll *a){
for (M=1;M<n+2;M<<=1);
for (int i=1;i<=n;i++)
T[M+i]=abcd(point(a[i],i),point());
for (int i=M-1;i;i--)
T[i]=Min(T[i<<1],T[i<<1|1]);
}
inline abcd Query(int s,int t){
abcd ret;
for (s+=M-1,t+=M+1;s^t^1;s>>=1,t>>=1){
if (~s&1) ret=Min(ret,T[s^1]);
if ( t&1) ret=Min(ret,T[t^1]);
}
return ret;
}
}Seg1,Seg2;
struct edge{
int u,v,w,next;
};
edge G[N<<1];
int head[N],inum=1;
inline void add(int u,int v,int w,int p){
G[p].u=u; G[p].v=v; G[p].w=w; G[p].next=head[u]; head[u]=p;
}
int n; ll Ans,ans;
int vst[N];
int pnt,cir[N];
ll dis[N<<1],val[N<<1];
#define V G[p].v
inline int dfs(int u,int fa)
{
vst[u]=1;
int ret=0,d;
for (int p=head[u];p;p=G[p].next)
if (p!=(fa^1) && vst[V]!=2)
{
if (vst[V]==1)
{
vst[u]=2; cir[++pnt]=u,dis[pnt]=G[p].w;
ret=V; continue;
}
d=dfs(V,p);
if (d)
{
vst[u]=2; cir[++pnt]=u,dis[pnt]=G[p].w;
if (d!=u) ret=d; else ret=0;
}
}
return ret;
}
ll g[N];
inline void dfs2(int u,int fa){
for (int p=head[u];p;p=G[p].next)
if (V!=fa && vst[V]!=2)
{
dfs2(V,u);
ans=max(ans,g[u]+G[p].w+g[V]);
g[u]=max(g[u],G[p].w+g[V]);
}
}
int Q[N<<1],l,r;
ll f[N<<1],sum[N<<1];
inline ll dist(int u,int v){
return sum[v-1]-sum[u-1];
}
ll tmp[N<<1];
inline void Solve()
{
for (int i=1;i<=pnt;i++) val[i+pnt]=val[i],dis[i+pnt]=dis[i];
for (int i=1;i<=pnt<<1;i++) sum[i]=sum[i-1]+dis[i];
for (int i=1;i<=pnt<<1;i++) tmp[i]=val[i]-sum[i];
Seg1.Build(pnt<<1,tmp);
for (int i=1;i<=pnt<<1;i++) tmp[i]=sum[i]+val[i];
Seg2.Build(pnt<<1,tmp);
Ans=1LL<<60;
for (int i=1;i<=pnt;i++){
abcd a1=Seg1.Query(i,i+pnt-1),a2=Seg2.Query(i,i+pnt-1);
if (a1.first.idx==a2.first.idx)
Ans=min(Ans,max(ans,max(a1.first.f+a2.second.f,a2.first.f+a1.second.f)));
else
Ans=min(Ans,max(ans,a1.first.f+a2.first.f));
}
}
int main()
{
int iu,iv,iw;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(n);
for (int i=1;i<=n;i++)
read(iu),read(iv),read(iw),add(iu,iv,iw,++inum),add(iv,iu,iw,++inum);
pnt=0; ans=0;
dfs(1,0);
for (int j=1;j<=pnt;j++) dfs2(cir[j],0),val[j]=g[cir[j]];
Solve();
printf("%.1lf\n",Ans/2.0);
return 0;
}