？？？
by Underratted @ 2019-07-15 20:51:52
您注册都快两年了，不知道有没有时间阅读一下 [这个东西](https://www.luogu.org/wiki/show?name=%E5%B8%AE%E5%8A%A9%EF%BC%9Amarkdown) 呢（雾）
by hsfzLZH1 @ 2019-07-15 20:52:52
@[黄朗初](/space/show?uid=62570) 把你的源码放进来，不是第一次发的乱七八糟的东西
by RainFestival @ 2019-07-15 20:55:23
补：
```cpp
#include<bits / stdc++.h>
using namespace std;
int n, m, f[1001], ts, ans;
struct e
{
int u, v, w;
} edge[200001];
bool cmp(e a, e b) { return a.w < b.w; }
int get_father(int o)
{
while(f[o] != o)
return get_father(f[o]);
return o;
}
bool judge(int u, int v)
{
int fu = get_father(u);
int fv = get_father(v);
if(fu != fv)
{
f[fu] = fv;
return true;
}
return false;
}
main()
{
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++)
f[i] = i;
for(int u, v, w, i = 1; i <= m; i++)
scanf("%d%d%d", &edge[i].u, &edge[i].v, &edge[i].w);
sort(edge + 1, edge + m + 1, cmp);
for(int i = 1; i <= n; i++)
{
if(judge(edge[i].u, edge[i].v))
ts++, ans = max(ans, edge[i].w);
if(ts == n - 1)
{
printf("%d", ans);
return 0;
}
}
printf("-1");
}
```
by hsfzLZH1 @ 2019-07-15 20:55:43
orz tgl
by 白上吹雪 @ 2019-07-15 20:56:01
最后一个for里吧n改成m
by 白上吹雪 @ 2019-07-15 21:02:35
@[白上吹雪](/space/show?uid=62568) 多谢大佬们，抱歉我所带来的不便，已AC
by 黄朗初 @ 2019-07-15 21:03:25
@[白上吹雪](/space/show?uid=62568) 红这么快tql
by 冰川凛 @ 2019-07-15 21:45:19