HDU 3道最小生成树题目
摘要:
//hdu1879 还是畅通工程#include <iostream>#include <algorithm>#define MAX 5000using namespace std;int father[MAX];int my_rank[MAX];void make_set(){ for (int i = 0; i < MAX; i++) { my_rank[i]... 阅读全文
posted @ 2010-12-06 21:38 sysuwhj 阅读(2912) 评论(0) 推荐(0) 编辑