dijksta 模板
摘要:#include using namespace std; #define INF 0x3f3f3f3f int dis[35]; int visit[35]; int SSSP[35][35]; void dijkstra(int x,int n) { int pos; int minn; for(int i=1;i>n>>m; memset(visit,0,...
阅读全文
hdu5173 How Many Maos Does the Guanxi Worth
摘要:#include using namespace std; #define INF 0x3f3f3f3f int dis[35]; int visit[35]; int SSSP[35][35]; void dijkstra(int x,int n) { int pos; int minn; for(int i=1;i>n>>m; if(n==0&&m==0) ...
阅读全文