POJ 3522 暴力+图论
来源:互联网 发布:苏州软件培训哪家好 编辑:程序博客网 时间:2024/05/17 03:26
Description
Given an undirected weighted graph G, you should find one of spanning trees specified as follows.
The graph G is an ordered pair (V, E), where V is a set of vertices {v1,v2, …, vn} and E is a set of undirected edges {e1,e2, …, em}. Each edge e ∈ E has its weightw(e).
A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices withn − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among then − 1 edges of T.
Figure 5: A graph G and the weights of the edges
For example, a graph G in Figure 5(a) has four vertices {v1,v2, v3, v4} and five undirected edges {e1,e2, e3, e4, e5}. The weights of the edges arew(e1) = 3, w(e2) = 5, w(e3) = 6, w(e4) = 6, w(e5) = 7 as shown in Figure 5(b).
Figure 6: Examples of the spanning trees of G
There are several spanning trees for G. Four of them are depicted in Figure 6(a)~(d). The spanning treeTa in Figure 6(a) has three edges whose weights are 3, 6 and 7. The largest weight is 7 and the smallest weight is 3 so that the slimness of the treeTa is 4. The slimnesses of spanning trees Tb,Tc and Td shown in Figure 6(b), (c) and (d) are 3, 2 and 1, respectively. You can easily see the slimness of any other spanning tree is greater than or equal to 1, thus the spanning tree Td in Figure 6(d) is one of the slimmest spanning trees whose slimness is 1.
Your job is to write a program that computes the smallest slimness.
Input
The input consists of multiple datasets, followed by a line containing two zeros separated by a space. Each dataset has the following format.
Every input item in a dataset is a non-negative integer. Items in a line are separated by a space. n is the number of the vertices and m the number of the edges. You can assume 2 ≤n ≤ 100 and 0 ≤ m ≤ n(n − 1)/2. ak andbk (k = 1, …, m) are positive integers less than or equal ton, which represent the two vertices vak andvbk connected by the kth edge ek.wk is a positive integer less than or equal to 10000, which indicates the weight ofek. You can assume that the graph G = (V, E) is simple, that is, there are no self-loops (that connect the same vertex) nor parallel edges (that are two or more edges whose both ends are the same two vertices).
Output
For each dataset, if the graph has spanning trees, the smallest slimness among them should be printed. Otherwise, −1 should be printed. An output should not contain extra characters.
Sample Input
4 51 2 31 3 51 4 62 4 63 4 74 61 2 101 3 1001 4 902 3 202 4 803 4 402 11 2 13 03 11 2 13 31 2 22 3 51 3 65 101 2 1101 3 1201 4 1301 5 1202 3 1102 4 1202 5 1303 4 1203 5 1104 5 1205 101 2 93841 3 8871 4 27781 5 69162 3 77942 4 83362 5 53873 4 4933 5 66504 5 14225 81 2 12 3 1003 4 1004 5 1001 5 502 5 503 5 504 1 1500 0
Sample Output
1200-1-110168650
Source
#include<stdio.h>#include<algorithm>#define inf 99999999using namespace std;struct node{int u;int v;int len;};node e[5005];node E[105];int map[105][105];int n,m;bool cmp(node a,node b){return a.len<b.len;}int prim(){int i,j,vx,vy,leng,min,minl;int ret=0,sum=0;for(i=1;i<=n-1;i++){E[i].u=1;E[i].v=i+1;E[i].len=map[1][i+1];}for(i=1;i<=n-1;i++){minl=inf;min=-1;for(j=i;j<=n-1;j++){if(E[j].len<=minl){minl=E[j].len;min=j;}}if(min==-1)break;if(minl>ret)ret=minl;sum=sum+minl;swap(E[i],E[min]);vx=E[i].v;for(j=i+1;j<=n-1;j++){vy=E[j].v;leng=map[vx][vy];if(leng<E[j].len){E[j].len=leng;E[j].u=vx;}}}if(sum>=inf)return inf;elsereturn ret;}void init(){int i,j;for(i=0;i<=n;i++)for(j=0;j<=n;j++)map[i][j]=inf;}int main(){int i;while(scanf("%d%d",&n,&m)!=EOF){if(n==0&&m==0)break;init();int a,b,l;for(i=1;i<=m;i++){scanf("%d%d%d",&a,&b,&l);map[a][b]=l;map[b][a]=l;e[i].u=a;e[i].v=b;e[i].len=l;}sort(e+1,e+m+1,cmp);int min=prim();if(min>=inf){printf("-1/n");continue;}min=min-e[1].len;for(i=1;i<=m;i++){map[e[i].u][e[i].v]=inf;map[e[i].v][e[i].u]=inf;int ans=prim();if(ans>=inf)break;ans=ans-e[i+1].len;if(ans<min)min=ans;}printf("%d/n",min);}return 0;}
- POJ 3522 暴力+图论
- POJ 1142 暴力!
- POJ 3697 BFS暴力
- poj 3102(暴力枚举)
- poj 3080 KMP+暴力
- poj 1247 暴力
- POJ 1380 暴力搜索
- POJ 1050 暴力
- POJ 1125 暴力+Dijkstra
- poj-1691-暴力DFS
- poj 2918Tudoku(暴力。。)
- poj 1690 暴力
- POJ 1054 暴力搜索
- poj 1840 Eqs 暴力
- POJ 2029 DP || 暴力
- POJ 2718 暴力枚举
- Fishnet(暴力POJ 1408)
- poj 2785 二分暴力
- Android个人原创软件《WebClient》
- For 循环语句(100的阶乘代码)
- 用python或者perl实现简单的http服务器目录共享
- 2072 strtok
- CCNA实验十一 STP
- POJ 3522 暴力+图论
- linux 关机
- [转] 大公司是如何走上开放源码之路的
- ssh面试题
- Tomcat虚拟主机域名的设置
- c语言socket编程指南
- SQL Server命令备份数据库
- visual studio 2005 对话款添加类、变量报错问题解决
- 学习是件快乐的事情!