我的随笔

51nod 1295 XOR key-区间异或最大值-可持久化01Trie树(模板)

ZERO- 2019-01-17 16:33 阅读:761 评论:0 推荐:0

BZOJ 2588: Spoj 10628. Count on a tree-可持久化线段树+LCA(点权)(树上的操作) 无语(为什么我的LCA的板子不对)

ZERO- 2019-01-17 13:24 阅读:200 评论:0 推荐:0

Sleeping In

ZERO- 2019-01-13 20:28 阅读:12 评论:4 推荐:0

Codeforces 1099 D. Sum in the tree-构造最小点权和有根树贪心+DFS(Codeforces Round #530 (Div. 2))

ZERO- 2019-01-13 20:02 阅读:516 评论:0 推荐:0

Codeforces 1099 C. Postcard-字符串处理(Codeforces Round #530 (Div. 2))

ZERO- 2019-01-13 19:50 阅读:513 评论:0 推荐:0

Codeforces 1099 B. Squares and Segments-思维(Codeforces Round #530 (Div. 2))

ZERO- 2019-01-13 19:42 阅读:573 评论:0 推荐:0

Codeforces 1099 A. Snowball-暴力(Codeforces Round #530 (Div. 2))

ZERO- 2019-01-13 19:36 阅读:406 评论:0 推荐:0

Codeforces 1 C. Ancient Berland Circus-几何数学题+浮点数求gcd ( Codeforces Beta Round #1)

ZERO- 2018-12-02 16:05 阅读:444 评论:0 推荐:0

Codeforces 1082 D. Maximum Diameter Graph-树的直径-最长链-构造题 (Educational Codeforces Round 55 (Rated for Div. 2))

ZERO- 2018-11-30 21:43 阅读:509 评论:0 推荐:0

Codeforces 1082 C. Multi-Subject Competition-有点意思 (Educational Codeforces Round 55 (Rated for Div. 2))

ZERO- 2018-11-30 21:38 阅读:336 评论:0 推荐:0