好经典的一道题,并查集 + 贪心。
方法是对所有边从大到小排序后,依次枚举最小边和最大边,在每一次枚举的时候用并查集判断起点和终点是否已联通。
#include<iostream>
#include<cstdio>
using namespace std;
#define inf 0x3f3f3f3f
int father[210];
struct rd
{
int s, t, len;
}road[1010];
int cmp(const void *a, const void *b)
{
struct rd *c = (rd*)a;
struct rd *d = (rd*)b;
return c->len - d->len;
}
int find(int x)
{
if(father[x] == x)return x;
return father[x] = find(father[x]);
}
void unionset(int x, int y)
{
int xx = find(x);
int yy = find(y);
if(xx != yy)
father[xx] = yy;
}
int main()
{
int n, m, q;
while(~scanf("%d%d", &n, &m))
{
for(int i = 1; i <= m; i++)
{
scanf("%d%d%d", &road[i].s, &road[i].t, &road[i].len);
}
qsort(road+1, m, sizeof(road[0]), cmp);
scanf("%d", &q);
int st, end;
while(q--)
{
scanf("%d%d", &st, &end);
int ans = inf;
int i, j;
for(i = 1; i <= m; i++)
{
for(int i = 1; i <= n; i++)
father[i] = i;
for(j = i; j <= m; j++)
{
unionset(road[j].s, road[j].t);
if(find(st) == find(end))break;
}
if(j == m+1)break;
if(road[j].len - road[i].len < ans)
ans = road[j].len - road[i].len;
}
printf("%d\n", ans==inf?-1:ans);
}
}
return 0;
}