最短路
文章平均质量分 79
奋斗中的小石头
这个作者很懒,什么都没留下…
展开
-
最短路(Dijstra+矩阵转置) Silver Cow Party
#include#include#define maxn 1005#define INF 0x3f3f3f3fint Edge[maxn][maxn],Dis[maxn],vis[maxn],Dis2[maxn];int n,m,x;void Dijstra( ){int i,j,k,mi;memset(vis,0,sizeof vis);memset(Dis,0x3f,sizeof Dis);D原创 2014-04-26 00:19:41 · 531 阅读 · 0 评论 -
最短路(Dijstra) A strange lift
#include#include#define maxn 300#define INF 0x3f3f3f3fint Edge[maxn][maxn],vis[maxn],Dis[maxn];int n,a,b;void Dijstra(){ int i,now,j,mi; memset(vis,0,sizeof vis); memset(Dis,原创 2014-04-26 01:31:25 · 414 阅读 · 0 评论 -
最短路(Dijstra) 畅通工程续
畅通工程续 Time Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 112 Accepted Submission(s) : 42Font: Times New Roman | Verdana | GeorgiaFont Siz原创 2014-04-26 01:23:00 · 405 阅读 · 0 评论 -
最短路(Dijstra) 一个人的旅行
一个人的旅行 Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 165 Accepted Submission(s) : 50Font: Times New Roman | Verdana | GeorgiaFont Si原创 2014-04-26 01:17:14 · 460 阅读 · 0 评论 -
最短路 (Dijstra) 最短路
#include #pragma comment (linker,"/STACK:102400000,102400000")#define maxn 105#define MAXN 100005#define INF 0x3f3f3f3f#define pi acos(-1.0)#define eps 1e-6using namespace std;int n,原创 2014-04-26 01:09:16 · 456 阅读 · 0 评论 -
最短路(floyd) Cow Contest
#include#include#define maxn 105#define INF 0x3f3f3f3fint VS[maxn][maxn];int n,m;void floyd(){ int i,j,k; for(k=1;k for(i=1;i for(j=1;j {原创 2014-04-26 01:02:28 · 417 阅读 · 0 评论 -
最短路(floyd) Cow Hurdles
#include#include#include#define maxn 305#define INF 0x3f3f3f3fint n,m,t;int Edge[maxn][maxn];int max(int a,int b){ return a>b?a:b;}void floyd(){ for ( int k= 1; k原创 2014-04-26 00:52:51 · 369 阅读 · 0 评论 -
最短路 (Dijstra) Til the Cows Come Home
#include#include#define maxn 1005#define INF 0x3f3f3f3fint Dis[maxn],vis[maxn],Edge[maxn][maxn];int t,n;void Dijstra(){ int i,j,now,mi; memset(Dis,0x3f,sizeof Dis); memset原创 2014-04-26 00:27:10 · 739 阅读 · 0 评论 -
最短路(Bellman_ford) Currency Exchange
#include#include#include#define maxn 1000#define INF 0x3f3f3f3f#define eps 1e-6int n,m,s;double v;int U[2*maxn],V[2*maxn];double R[2*maxn],C[2*maxn],Sum[2*maxn];int Bellman_ford()原创 2014-04-26 00:39:17 · 375 阅读 · 0 评论