摘要：
简单最小生成树，继续我的kruskal#include#include#include#includeusing namespace std;const int MAX=1000000;struct node{ int left,right,cost;}road[MAX];bool cmp(n... 阅读全文
posted @ 2014-04-30 23:25
Hust_BaoJia
阅读(109)
评论(0)
推荐(0)
摘要：
又是一道简单并查集#include#include#include#include#include#include#include#include#include#include#include#define inf 0x0f0f0f0fusing namespace std;const doub... 阅读全文
posted @ 2014-04-30 23:18
Hust_BaoJia
阅读(118)
评论(0)
推荐(0)
摘要：
简单并查集#include#include#include#include#include#include#include#include#include#include#include#define inf 0x0f0f0f0fusing namespace std;const double p... 阅读全文
posted @ 2014-04-30 22:38
Hust_BaoJia
阅读(127)
评论(0)
推荐(0)
浙公网安备 33010602011771号