随笔分类 - ACM—最小生成树
摘要:1.prim算法求解,其思路与dijkstra差不多,不断贪心往已选定的集合众添加点,最终得到一棵最小生成树。具体为什么最小说不清==, 1 int map[105][105]; 2 int mincost[105]; 3 int vis[105]; 4 void prim() 5 { 6 ...
阅读全文
摘要:还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34391Accepted Submission(s): 15542Problem De...
阅读全文
摘要:Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18256Accepted Submission(s): 697...
阅读全文

浙公网安备 33010602011771号