10/30的update:如果是冲着dijk的板子来的,建议看多校联考contest中第二场day2的T2,那边的写法比较优秀... -------------------------------------------- 编译器真是神经了  k=k*2打成了k*2居然都不报错  还一点事情没有 害我改一晚上 一开始忘记了c++的数组默认从0开始 后来又把dijk写T了.....重申一遍,这里是先把所有点加进去然后依次pop() 至于这道题,大家都说它是一道数论好题 而狗王一定要把它当作spfa…

Description through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y, there is a bidirectional road between towns x and yif and only if there is no railway between them. Travell…

http://poj.org/problem?id=3114 缩点+DIJK 注意缩点之后有重边啊 floyd会TLE #include <iostream> #include<cstring> #include<cstdio> #include<stdlib.h> #include<algorithm> #include<stack> #define N 510 #define M 301000 #define INF 0xffff…

终于A 了,这题做着真麻烦 题目:http://poj.org/problem?id=1062 dijk 一般用于正权有向图 此题的关键在于等级限制的处理,最好的办法是采用枚举,即假设酋长等级为5,等级限制为2,那么需要枚举等级从3~5,4~6,5~7 题意就不用说了,做poj以来的第一道中文题目. 要考虑间接身份差异不可行的情况 如:1 410000 3 22 13 31000 2 24 13 11000 3 14 2100 4 0错误程序出104,答案105. 对于这组数据错误的程序是4->…

#include<iostream> #include<math.h> #include<stdio.h> #include<algorithm> #include<time.h> using namespace std; int map[100][100]={0}; int book[100]={0}; int dis[100]={0};//顶点 int n=0,m=0; int minn=99999; int u=0; void Dijk()…

题意: 有n个城市,有m条路,给出每条路的出发和结束的城市及长度,求从第一个城市到最后一个城市的最短路.按格式输出. power oj 2443 题解: 标准dijk算法. #include<cstdio> #include<cstring> #include<algorithm> #include<iostream> using namespace std; const int INF=0x3f3f3f3f; const int maxn=505; typ…

.....................用矩阵存..................... 1 int mp[N][N]; bool p[N]; int dist[N]; void dijk(int s , int n) { int i , j , k ; ; i <= n ;i++) { p[i] = false; dist[i] = mp[s][i]; } p[s] = true; dist[s] = ; ; i < n ; i++) { int Min = INF; ; ; j <…

题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=1245 Saving James Bond Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2608    Accepted Submission(s): 505 Problem Description This time let us con…

http://acm.hdu.edu.cn/showproblem.php?pid=2680 Choose the best route Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9602    Accepted Submission(s): 3111 Problem Description One day , Kiki wants…

#include<iostream> #include<cstring> using namespace std; #define INF 0x3f3f3f3f int n,m; ][]; ]; ]; int dijk(){ memset(vis,,sizeof(vis)); vis[]=; //标记第一个已选 memset(stemp,,sizeof(stemp)); int min; ,countx=,county,index2; while(county!=n){//如果是联…