poj1251 Jungle Roads
来源:互联网 发布:淘宝返利多少 编辑:程序博客网 时间:2024/05/01 16:43
链接:http://poj.org/problem?id=1251
我是来套模板的%>_<%
#include<iostream>#define MAXN 400#define MAXROAD 30#define MAXCOST 105using namespace std;int roads[MAXN][MAXN];int lowcost[MAXROAD],closest[MAXROAD];int prim(int v,int n){ int i,j,mindis,minone; int ans=0; for(i=0;i<n;i++) { lowcost[i]=roads[v][i];closest[i]=v; } lowcost[v]=0; for(i=0;i<n-1;i++) { mindis=MAXCOST; for(j=0;j<n;j++) if(lowcost[j]&&mindis>lowcost[j]) { mindis=lowcost[j]; minone=j; } ans+=lowcost[minone]; lowcost[minone]=0; for(j=0;j<n;j++) if(roads[j][minone]<lowcost[j]) { lowcost[j]=roads[j][minone];closest[j]=minone; } } return ans;}int main(){ int n,k,cost;int i,j;char a,b;while(cin>>n&&n){for(i=0;i<n;i++)for(j=0;j<n;j++) roads[i][j]=MAXCOST;for(i=0;i<n-1;i++){ cin>>a>>k; for(j=0;j<k;j++) {cin>>b>>cost;roads[a-65][b-65]=cost;roads[b-65][a-65]=cost; }}cout<<prim(0,n)<<endl;} return 0;}
0 0
- poj1251 Jungle Roads
- poj1251 - Jungle Roads
- POJ1251-Jungle Roads
- poj1251 Jungle Roads
- poj1251 Jungle Roads
- POJ1251 Jungle Roads(kru)
- poj1251 Jungle Roads
- Jungle Roads(POJ1251)(primer)
- POJ1251 Jungle Roads
- POJ1251 Jungle Roads
- HDU1301&&POJ1251 Jungle Roads
- POJ1251 Jungle Roads
- poj1251 Jungle Roads
- poj1251 Jungle Roads
- poj1251 Jungle Roads
- POJ1251 Jungle Roads Prim算法
- poj1251 hdu 1301 Jungle Roads
- POJ1251- Jungle Roads(Kruskal)
- 九度1550:分糖果
- uva10651 - Pebble Solitaire(dp)
- ubuntu服务器搭建pptp服务实现vpn服务器
- CMake 用法导览
- linux tar 解压命令总结
- poj1251 Jungle Roads
- 纯CSS实现侧边栏/分栏高度自动相等
- RCU机制分析
- Vim使用技巧
- How I Turned Down $300,000 from Microsoft to go Full-Time on GitHub
- 传全智贤欲收山生子 豪门老公背景揭秘
- Android 图表
- Android中如何做到Service被关闭后又自动启动
- VMware vSphere Client 配置CentOS网卡