HDU 5624 KK's Reconstruction

这题目测是数据水了。我这种暴力写法显然是可以卡超时的。

假设有2000个点，15000条边，前面10000条不能构成树，后面5000条可以，这种数据显然可以卡超时。

#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <queue>
#include <stack>
#include <map>
#include <vector>
using namespace std;

const int maxn =  + ;
const int maxm =  + ;
const int inf = 0x7fffffff;
int T;
int n, m;
struct Edge
{
    int u;
    int v;
    int id;
    int val;
}e[maxm];
int fa[maxn];

bool cmp(const Edge&a, const Edge&b)
{
    return a.val<b.val;
}

void read()
{
    scanf("%d%d", &n, &m);
    for (int i = ; i <= m; i++)
        scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].val);
    sort(e + , e +  + m, cmp);
}

int Find(int x)
{
    if (x != fa[x]) fa[x] = Find(fa[x]);
    return fa[x];
}

void work()
{
    int ans = inf;
    int i, j;
    int cnt;
    for ( i = ; i <= m; i++)
    {
        for ( j = ; j <= n; j++) fa[j] = j;
        cnt = n;
        for ( j = i; j <= m; j++)
        {
            int fu = Find(e[j].u);
            int fv = Find(e[j].v);
            if (fu == fv) continue;
            fa[fu] = fv; cnt--;
            if (cnt == )
            {
                ans = min(ans, e[j].val - e[i].val);
                break;
            }
        }
        if (cnt != ) break;
    }

    if (ans == inf) ans = -;
    printf("%d\n", ans);
}

int main()
{
    scanf("%d", &T);
    while (T--)
    {
        read();
        work();
    }
    return ;
}