题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4141
思路:将边按从小到大排序,设l,r。则在[l,r]范围内的值一定小于等于w[r]-w[l],则若l...r之间的边可形成生成树,则更新答案,同时将l++,r=l。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define debu
using namespace std;
const int maxn=105;
const int INF=0x3f3f3f3f;
const int maxm=10000+50;
struct Node
{
int u,v,w;
};
int ans,n,m;
int fa[maxn];
Node e[maxm];
int Find(int x)
{
return fa[x]==x?x:fa[x]=Find(fa[x]);
}
int cmp(Node a,Node b)
{
return a.w<b.w;
}
int main()
{
#ifdef debug
freopen("in.in","r",stdin);
#endif // debug
while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
{
ans=INF;
for(int i=0; i<m; i++)