最短路
dominating大树置林
l love acm!
展开
-
hdu2544最短路
#include#include#define inf 0x3f3f3f3fint map[105][105],v[500005],d[500005],n,m;void init(){ for(int i=1;i<105;i++) { for(int j=1;j<105;j++) { if(i==j) map[i][j]=0; else map[i][j]=inf原创 2014-08-14 20:17:13 · 382 阅读 · 0 评论 -
hdu 2544 spfa
#include #include #define MAX 999999999#define N 1001int d[1002],n,m;int edges[1005][1005];int queue[1000001];int SPFA(int s){ int i; bool visit[N] = {false}; int front = 0, rear =原创 2014-11-16 23:47:46 · 450 阅读 · 0 评论