投稿

Codeforces 1082G. Petya and Graph (Mincut)

AtCoder Dwango Programming Contest V E.Cyclic GCD (DP+Polynomials)

Codeforces 1062E. Company (LCA+RMQ)

Range Query Problems, Mo's Algorithm and Rollback Square Root Decomposition

Codeforces 1078C. Vasya and Maximum Matching (Tree+DP)

Codeforces 1070E. Getting Deals Done (Binary Search+Fenwick Tree)

Codeforces 1073E. Segment Sum (Digit DP)

Codeforces 1065E. Side Transmutations (Burnside's Lemma)

Burnside's lemma and Polya enumeration theorem

使用Docker-Compose部署Flask+Gunicorn+Nginx应用

Treap

51Nod 1313. 完美数(dp+前缀和)

可持久化并查集(Persistent Union-Find)

51Nod 1295. XOR key[区间最大异或](可持久化Trie)

51Nod 1294. 修改数组(贪心+最长不下降子序列)