摘要: #include #include #include #include #define INF 0x3f3f3f3fusing namespace std;double dist[201],grid[201][201];int visit[201],n;structnode{ double x,y;}g[201];double Dijkstra(){ double maxn,minc; int num=1,k,i; memset (visit,0,sizeof(visit)); for (i = 1; i <= n; i++) dist[i] = g... 阅读全文
posted @ 2013-12-16 21:12 单调的幸福 阅读(173) 评论(0) 推荐(0) 编辑