- 博客(76)
- 收藏
- 关注
原创 区域个数 坐标离散化 BFS算法
题解:这题就是离散化加BFS就好了。具体过程代码注释里有。#include #define mem(a, b) memset(a, b, sizeof(a))#define eps 0.000000000001#define pi acos(-1)using namespace std;int n, mps[3005][3005], numx[3005], numy[3005],
2017-03-07 00:08:17
872
原创 HDU 5335 Walk Out BFS + 贪心 2015 Multi-University Training Contest 4 1009
HDU 5335 Walk Out BFS + 贪心 2015 Multi-University Training Contest 4 1009
2015-07-30 22:41:06
767
原创 HDU 5336 XYZ and Drops 2015 Multi-University Training Contest 4 1010
HDU 5336 XYZ and Drops 2015 Multi-University Training Contest 4 1010
2015-07-30 17:52:37
904
3
原创 HDU 4771 Stealing Harry Potter's Precious BFS + 状压DP
HDU 4771 Stealing Harry Potter's Precious BFS + 状压DP
2015-07-29 20:22:00
618
原创 HDU 5316 Magician 2015 Multi-University Training Contest 3 1001 线段树
HDU 5316 Magician 2015 Multi-University Training Contest 3 1001
2015-07-29 15:11:14
855
原创 HDU 5323 2015 Multi-University Training Contest 3 1008 Solve this interesting problem
HDU 5323 2015 Multi-University Training Contest 3 1008 Solve this interesting problem
2015-07-28 22:09:48
796
3
原创 HDU 5294 Tricks Device 2015 Multi-University Training Contest 1 07
HDU 5294 Tricks Device 2015 Multi-University Training Contest 1 07
2015-07-23 23:00:26
600
原创 POJ 2983 Is the Information Reliable? 差分约束
POJ 2983 Is the Information Reliable? 差分约束
2015-04-22 00:13:23
706
原创 POJ 2594 Treasure Exploration 最小路径覆盖
POJ 2594 Treasure Exploration 最小路径覆盖
2015-04-19 00:10:33
601
转载 Trie树
本文转自:http://www.cnblogs.com/dolphin0520/archive/2011/10/11/2207886.html Trie树 Trie树也称字典树,因为其效率很高,所以在在字符串查找、前缀匹配等中应用很广泛,其高效率是以空间为代价的。一.Trie树的原理 利用串构建一个字典树,这个字典树保存了串的公共前缀信息,因此可以
2015-04-12 23:14:44
647
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人