数据结构
JalexDooo
努力中...
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
UVa 11988 Broken Keyboard (a.k.a. Beiju Text) 数组模拟
蓝书P244~P245#include #include #include #include #include using namespace std;typedef long long LL;const int INF = 0x3f3f3f3f;const int maxn = 100000 + 24;int Next[maxn], last, cur;char s[ma原创 2016-07-05 09:45:14 · 379 阅读 · 0 评论 -
CodeForces 339D
#include #include #include #include #include using namespace std;typedef long long LL;const int maxn = 20;int a[1<<maxn];int n, m, u, v;void Build() { int p = 1 << n, res = 0; while(p) {原创 2016-07-08 15:22:51 · 498 阅读 · 0 评论 -
HDU 3688 并查集
There is a piece of grids land of size n×m. Chandler and his team take responsibility to guard it. There are some searchlights on some pieces and each of them has a capability to lighten a distance towards four原创 2016-08-03 19:44:53 · 709 阅读 · 0 评论
分享