并查集
somniloquy_
为利益而活 如腐尸般不堪
展开
-
POJ-2253 Frogger
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int maxn = 40000 + 5;int n, pos;double max_len;struct coordinate{ int x,原创 2015-08-31 02:04:29 · 296 阅读 · 0 评论 -
HDU-1301 Jungle Roads
题目:Jungle Roads —— 并查集 + 最小生成树#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 75 + 5;int n, pos, m, ans, cnt;struct node{ int op原创 2015-08-31 12:15:37 · 345 阅读 · 0 评论 -
POJ-1797 Heavy Transportation
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1000 + 5;int t, n, m, ans;struct node{ int op; int ed; int len; bool原创 2015-08-31 23:06:39 · 354 阅读 · 0 评论 -
HDU-1198 Farm Irrigation
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int maxn = 51;int root[maxn * maxn];int m, n, sum;int type[11][4] = {{1, 0, 1, 0}, {1, 0, 0, 1}原创 2015-09-10 23:45:25 · 310 阅读 · 0 评论 -
HDU-1598 find the most comfortable road
#include #include #include #include using namespace std;const int maxn = 1000 + 5;int root[maxn];struct node{ int op; int ed; int speed; bool operator < (const node Next) con原创 2015-09-11 09:25:27 · 363 阅读 · 0 评论 -
HDU-5441 Travel
“`include include include include using namespace std;const int n_max = 2e4 + 5; const int m_max = 1e5 + 5; struct node { int op; int ed; int len; bool operator < (const node Nex原创 2015-09-13 20:28:35 · 532 阅读 · 0 评论 -
HDU-3635 Dragon Balls
#include <cstdio>using namespace std;const int n_max = 1e4 + 5;struct node{ int root; int leaf; int transfer;} ball[n_max];int t, n, q;int Find(int x){ if(x == ball[x].root)原创 2015-09-28 16:33:19 · 359 阅读 · 0 评论