亓天大圣是程序猿

分类

ACM(1) C++(6) Codeforces(2) GCD(1) win32(1) 图像(1) 图论500(9) 基础(11) 操作(9) 数据结构(4) 电脑(2) 算法(3) 网络(6)

/ 注册

全部文章（共56篇）

Graph Theory NO.8 HDU_1863_畅通工程_最小生成树

昨天RE了一晚上，今天重新打了一遍就过了，莫名其妙； #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define INF 0xffffff...

2017-10-14

0 356

Graph Theory NO.7_HDU_1233_还是畅通工程_最小生成树

#include <cstdio> #include <iostream> #include <cstring> #include <algorithm> using namespace std; #define INF 0xffffff int ma...

2017-10-12

0 406

Graph Theory NO.6 HDU_1232_畅通工程_并查集

#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> using namespace std; #define N 10009 int father[...

2017-10-12

0 402

Graph Theory NO.5 HDU_1102_Constructing Roads_最小生成树

prim() #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define INF 0xfff...

2017-10-11

0 326

Graph Theory NO.4 HDU_1856_More is better_并查集

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; int father[100009]; int num...

2017-10-10

0 459

Graph Theory NO.3 HDU_1325_Is It A Tree_并查集

#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> using namespace std; #define M 100009 int k=1; i...

2017-10-09

0 409

Graph Theory NO.2 HDU_1272_小希的迷宫_并查集

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; int father[100009]; int mar...

2017-10-09

0 342

Graph Theory NO.1 HDU_1213_How Many Tables_并查集

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; int num[10000]; int father[...

2017-10-09

0 390

并查集

初始化 int Init(int n)//初始化 { for(int i=1;i<=n;i++) { father[i]=i; num[i]=1; } return 0; } n是个数让每个成员的根变成自己 ...

2017-09-26

0 365

栈

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define STACK_INIT_SIZE 10...

2017-09-20

0 374