- 博客(4)
- 资源 (2)
- 收藏
- 关注
原创 名次树 - 模板
UvaLive 5031#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>#include <cstdlib>using namespace std;const int maxnode = 20005;const int maxw = 60005;const int maxc = 50
2015-09-19 10:46:57 746
原创 最短路 - Dijkstra()
http://acm.nyist.net/JudgeOnline/problem.php?pid=115#include <stdio.h>#include <string.h>#include <iostream>#include <stdlib.h>#define inf 0x3f3f3f3f#define N 1005using namespace std;int d[N], G
2015-09-18 17:31:37 479
原创 最小生成树 - Kruskal()
//http://acm.hdu.edu.cn/showproblem.php?pid=1233#include <cstdio>#include <algorithm>using namespace std;const int N = 105;int father[N];int find(int x){ if (x != father[x]) father[x
2015-09-10 15:03:08 462
原创 最小生成树 - Prime()
//http://acm.hdu.edu.cn/showproblem.php?pid=1102#include <bits/stdc++.h>#define N 111using namespace std;int n;int G[N][N];int vis[N], lowcost[N];int prime()//只与点有关O(n * n),适合稠密图{ int sum =
2015-09-10 08:49:21 583
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人