poj 1258
摘要:
原来POJ上也有这么多水题,连续三道裸的最小生成树了。View Code #include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>using namespace std;struct node{ int a, b, num; bool operator < ( const node& A) const { return num < A.num; }}edge[4100000];int N, e, set[2100], mp[510][510 阅读全文
posted @ 2012-07-12 10:09 more think, more gains 阅读(160) 评论(0) 推荐(0) 编辑