POJ 2387 Til the Cows Come Home(Dijkstra)
来源:互联网 发布:做贝斯四线谱软件 编辑:程序博客网 时间:2024/05/18 17:27
题目链接:POJ 2387
分析:直接套Dijkstra的模版。
CODE:
#include <iostream>#include <cstring>#include <string>using namespace std;const int maxint=0x3f3f3f;const int maxnum=1005;int dis[maxnum];int pre[maxnum];int c[maxnum][maxnum];int n,t;void Dijkstra(int n,int v,int *dis,int *pre, int c[maxnum][maxnum]){int vis[maxnum];memset(vis,0,sizeof(vis));for(int i=1;i<=n;i++){dis[i]=c[v][i];if(dis[i]==maxint) pre[i]=0;else pre[i]=v;}dis[v]=0;vis[v]=1;for(int i=1;i<=n;i++){int tmp=maxint;int u=v;for(int j=1;j<=n;j++){if((!vis[j])&&dis[j]<tmp){tmp=dis[j];u=j;}}vis[u]=1;for(int j=1;j<=n;j++){if((!vis[j])&&c[u][j]<maxint){if(c[u][j]+dis[u]<dis[j]){dis[j]=c[u][j]+dis[u];pre[j]=u;}}}}}void SearchPath(int *pre,int v,int u){int path[maxnum];int tot=1;path[tot++]=u;int tmp=pre[u];while(tmp!=v){path[tot++]=tmp;tmp=pre[tmp];}path[tot]=v;for(int i=tot;i>=1;i--){if(i==1) cout<<path[i]<<endl;else cout<<path[i]<<"->";}}int main(){#ifdef LOCALfreopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);#endif while(cin>>t>>n){for(int i=1;i<=n;i++){dis[i]=maxint;for(int j=1;j<=n;j++)c[i][j]=maxint;}int p,q,len;for(int i=1;i<=t;i++){cin>>p>>q>>len;if(len<c[p][q])c[p][q]=c[q][p]=len;}Dijkstra(n,1,dis,pre,c);//SearchPath(pre,1,n);cout<<dis[n]<<endl;}return 0;}
0 0
- POJ 2387 Til the Cows Come Home(Dijkstra判重边)
- POJ 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home(Dijkstra)
- POJ - 2387 Til the Cows Come Home(Dijkstra)
- POJ 2387 Til the Cows Come Home(Dijkstra算法)
- POJ 2387 Til the Cows Come Home(Dijkstra算法)
- poj 2387-Til the Cows Come Home-dijkstra
- POJ 2387 Til the Cows Come Home 最短路-Dijkstra
- POJ 2387 Til the Cows Come Home (Dijkstra)
- POJ 2387 Til the Cows Come Home(Dijkstra简单题)
- Til the Cows Come Home - POJ 2387 Dijkstra
- POJ 2387 || Til the Cows Come Home(最短路,dijkstra
- POJ 2387 Til the Cows Come Home (dijkstra)
- Dijkstra-POJ-2387-Til the Cows Come Home
- poj 2387 Til the Cows Come Home(dijkstra算法)
- 2387 poj Til the Cows Come Home【dijkstra,经典&&基础】
- poj 2387 Til the Cows Come Home(dijkstra)
- poj 2387 Til the Cows Come Home dijkstra
- Android 项目打包到 JCenter 的坑
- BZOJ 1093 ZJOI 2007 最大半连通子图 强联通分量+拓扑图DP
- IOS开发 深入坐标系frame,bounds,center,transform的作用于之间的联系
- jquery animate妙用
- Windows7 64位+Cuda6.5+vs2012 的caffe配置历程
- POJ 2387 Til the Cows Come Home(Dijkstra)
- 2016.01.24--h5第四天
- vb.net知识小汇总
- USACO-Section 3.1-PROB Agri-Net
- 主成分分析(PCA)最大方差解释最小平方误差解释
- User SCOTT executes the following command on the EMP table but has not issued COMMIT, ROLLBACK, or a
- 2015年大二上-数据结构-图-1-(3)图遍历算法实现
- JavaScript 常用功能总结
- java程序员面试笔试宝典之算法思路总结