HDU 2544 dijkstra
来源:互联网 发布:咖啡机跟手冲 知乎 编辑:程序博客网 时间:2024/05/16 11:44
水。。
#include <iostream>using namespace std;const int N = 105;const int INF = 0x1fffffff;int map[N][N];int D[N];int flag[N];int n, m;void init(){for(int i = 0; i < N; i++)for(int j = 0; j < N; j++)map[i][j] = INF;for(int i = 1; i <= N; i++)map[i][i] = 0;memset(flag, 0, sizeof(flag));}void dijkstra(){for(int i = 1; i <= n; i++)D[i] = map[1][i];for(int t = 1; t < n; t++){int min = INF;int index = -1;for(int i = 1; i <= n; i++){if(flag[i])continue;if(min > D[i]){min = D[i];index = i;}}flag[index] = 1;for(int i = 1; i <= n; i++){if(flag[i])continue;for(int j = 1; j <= n; j++){if(!flag[j])continue;if(D[i] > D[j] + map[j][i])D[i] = D[j] + map[j][i];}}}}int main(){while(scanf("%d%d", &n, &m), n || m){init();int x, y, len;for(int i = 0; i < m; i++){scanf("%d %d %d", &x, &y, &len);map[x][y] = map[y][x] = len;}dijkstra();cout << D[n] << endl;}return 0;}
- hdu 2544 (dijkstra)
- hdu 2544 dijkstra
- hdu 2544 dijkstra
- HDU 2544 dijkstra
- hdu 2544 (dijkstra)
- hdu 2544(Dijkstra)
- hdu 2544 dijkstra算法
- hdu 2544 Dijkstra算法
- hdu 2544 最短路--Dijkstra
- HDU-2544 朴素的dijkstra
- HDU 2544 最短路 dijkstra
- HDU 2544 Dijkstra 最短路
- hdu 2544最短路dijkstra
- hdu 2544 dijkstra最短路
- HDU 2544 最短路 Dijkstra
- [HDU 2544]最短路[Dijkstra]
- 【Dijkstra】-HDU-2544-最短路
- HDU--2544最短路【Dijkstra】
- RMAN/EXP ORA-01455: 转换列溢出整数数据类型
- 理解ThreadLocal
- vim 功能命令总结汇总
- layout设计 屏幕适配
- Uninstall Panda Internet Security 2013 with WindowsUninstaller.Org Removal Tips
- HDU 2544 dijkstra
- Multi-Channel video system 组成
- sed 实现cat -n
- 有关缩小undotbs1表空间的datafile大小
- SQLServer2000用存储过程将DTS包文件加载到服务器上
- 元字符
- Cisco模拟器的配置和使用说明
- JDK5.0 Annotation学习笔记(一)
- GCC文档中比较大小的宏定义