定根最小树形图 朱刘算法 luogu P4716

https://www.luogu.org/problem/P4716

#include
#define ll long long
#define rep(ii,a,b) for(int ii=a;ii<=b;++ii)
#define per(ii,a,b) for(int ii=b;ii>=a;--ii)
#define forn(i,x,g,e) for(int i=g[x];i;i=e[i].next)
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define ull unsigned long long
#define fi first
#define se second
#define mp make_pair
#define pii pair
#define all(x) x.begin(),x.end()
#define show(x) cout<<#x<<"="<>n>>m>>k;
  rep(i,1,m)cin>>e[i].a>>e[i].b>>e[i].c;
  cout<

 

转载于:https://www.cnblogs.com/nervendnig/p/11625479.html