XX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure—超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒适度”有特殊要求,即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求,flycar必须瞬间提速/降速,痛苦呀 ),
但XX星人对时间却没那么多要求。要你找出一条城市间的最舒适的路径。(SARS是双向的)。
Input
输入包括多个测试实例,每个实例包括:
第一行有2个正整数n (1
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string.h>
using namespace std;
#define maxn 1100
#define INF 999999999
int pre[maxn];
struct EDGE
{
int u,v,w;
} edge[maxn];
bool cmp(EDGE a,EDGE b)
{
return a.w<b.w;
}
int findroot(int num)
{
int temp = num;
while(pre[temp] != temp)
{
temp = pre[temp];
}
int temp1 = num;
while(pre[temp1] != temp)
{
int j = pre[temp1];
pre[temp1] = temp;
temp1 = j;
}
return pre[temp];
}
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m))
{
for(int 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);
int q;
scanf("%d",&q);
for(int i = 0; i < q; i++)
{
int x,y;
scanf("%d%d",&x,&y);
int minn = INF;
for(int j = 1; j <= m; j++)
{
for(int k = 1; k <= n; k++)
{
pre[k] = k;
}
for(int k = j; k <= m; k++)
{
int temp1 = findroot(edge[k].u);
int temp2 = findroot(edge[k].v);
if(temp1 != temp2)
{
pre[temp1] = temp2;
}
if(findroot(x) == findroot(y))
{
int temp = edge[k].w - edge[j].w;
if(temp < minn) minn = temp;
break;
}
}
}
if(minn != INF) printf("%d\n",minn);
else printf("-1\n");
}
}
}