dij
a451907
这个作者很懒,什么都没留下…
展开
-
最短路—1001
#include #include int map[101][101],n,a[101],v[101]; void dij() { int i,j,min,min_f=0; for(i=1;i { a[i]=map[1][i]; v[i]=0; } v[1]=1; for(i=1;i原创 2013-01-11 00:24:48 · 285 阅读 · 0 评论 -
poj3114 Countries in War(强连通分量+最短路)
Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1757 Accepted: 553 Description In the year 2050, after different attempts of the UN to mai原创 2013-01-28 20:49:48 · 1135 阅读 · 0 评论