bzoj 1083: [SCOI2005]繁忙的都市

裸最小生成树。。。一开始看是SCOI想应该没这么简单。

结果真尼玛这么简单。。好意思！！

/*
ID:WULALA
PROB:bzoj1083 
LANG:C++
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <fstream>
#include <ctime>
#define N 308 
#define M 10008 
#define mod
#define mid(l,r) ((l+r) >> 1)
#define INF 0x7ffffff
using namespace std;

int n,m,fa[N],cnt,ans,tot;

struct WULALA
{
    int x,y,value;
}e[2*M];

void add(int x,int y,int w)
{
    e[++cnt].value = w;
    e[cnt].y = y;
    e[cnt].x = x;
}

void init()
{
    scanf("%d%d",&n,&m);
    for (int i = 1;i <= m;i++)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        add(a,b,c);
    }
    for(int i = 1;i <= n;i++) fa[i] = i;
}

bool cmp(WULALA a,WULALA b)
{
    return (a.value < b.value);
}

int find(int a)
{
    if (a == fa[a]) return a;
    return (fa[a] = find(fa[a]));
}

void work()
{
    sort(&e[1],&e[cnt+1],cmp);
    for (int i = 1;i <= cnt;i++)
        if(find(e[i].x) != find(e[i].y))
        {
            ans = e[i].value;
            tot++;
            fa[find(e[i].x)] = e[i].y;
        } 
    printf("%d %d
",tot,ans);
}

int main()
{
    init();
    work();
    return 0;
}