图论
关注
分享
扫一扫
文章平均质量分 52
Griffin_0
这个作者很懒，什么都没留下…
展开
-
hdu1874-畅通工程续
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 256#define MODtypedef long long ll;#define FOR(i,j,n)原创 2015-08-26 19:19:29 · 367 阅读 · 0 评论 -
hdu1856 More is better 并查集
#include#include#define Maxn 10000005int father[Maxn],num[Maxn];void init(){ for(int i=1;i<=Maxn;i++) { father[i]=i; num[i]=1; }}int getf(int x){ if(x!=father[x])原创 2015-10-08 20:20:13 · 408 阅读 · 0 评论 -
hdu1213 How Many Tables 并查集
#include#include#define Maxn 1024int father[Maxn];void init(int n){ for(int i=1;i<=n;i++) father[i]=i;}int getf(int x){ if(x!=father[x]) father[x]=getf(father[x]); return fathe原创 2015-10-08 17:32:10 · 372 阅读 · 0 评论 -
hdu1272 小希的迷宫 并查集
#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 100005typedef long long ll;#define rep(i,j,n) for(int i=j;i<=n;原创 2015-10-08 18:29:23 · 358 阅读 · 0 评论 -
图的遍历
深度优先遍历#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 1024#define MODtypedef long long ll;#define F原创 2015-08-27 11:25:59 · 307 阅读 · 0 评论 -
图的存储方式
图的存储结构1.邻接矩阵 即二维数组 初始化需要O(n^2)的复杂度建图需要O(m)总时间复杂度为O(n^2)空间上邻接矩阵的开销也是O(n^2)与点的个数有关.优点是简单实现，缺点是遍历效率低且不能存储重边2.前向星 一种通过存储边信息的方式来存储图的数据结构。构造方式非常简单，读入每条边的信息，将边存放在数组中，把数组中的点按起点顺序排序。构造如下int hea原创 2015-08-27 15:29:27 · 339 阅读 · 0 评论 -
hdu1150poj1325-Machine Schedule
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 128#define MODtypedef long long ll;#define FOR(i,j,n)原创 2015-08-26 21:02:20 · 322 阅读 · 0 评论 -
hdu1869-六度分离(floyd模板题)
/** hdu1869 **/#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 105typedef long long ll;#define rep(i,j,n) for原创 2015-08-23 16:05:45 · 375 阅读 · 0 评论 -
hdu1863-畅通工程
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn#define MODtypedef long long ll;#define FOR(i,j,n) for原创 2015-08-26 20:04:20 · 341 阅读 · 0 评论 -
hdu2066-一个人的旅行
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 1024#define MODtypedef long long ll;#define FOR(i,j,n原创 2015-08-26 17:03:13 · 304 阅读 · 0 评论 -
hdu1233-还是畅通工程
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn#define MODtypedef long long ll;#define FOR(i,j,n) for原创 2015-08-26 16:27:22 · 362 阅读 · 0 评论 -
hdu1232-畅通工程(并查集)
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 1024#define MODtypedef long long ll;#define FOR(i,j,n原创 2015-08-26 17:26:28 · 328 阅读 · 0 评论 -
hdu2112- HDU Today
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 155#define MODtypedef long long ll;#define FOR(i,j,n)原创 2015-08-26 18:56:14 · 307 阅读 · 0 评论 -
hdu1879-继续畅通工程
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn#define MODtypedef long long ll;#define FOR(i,j,n) for原创 2015-08-26 16:24:47 · 357 阅读 · 0 评论 -
hdu2544最短路
#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 128#define MODtypedef long long ll;#define FOR(i,j,n)原创 2015-11-01 14:01:33 · 390 阅读 · 0 评论