wangwangyu

最新文章

线段树中区间加减和区间覆盖的双标记问题

E. Sergey and Subway

2017CCPC 哈尔滨 B

0/1分数规划

中位数及带权中位数题集

code forces 1051 d

Educational Codeforces Round 51 (Rated for Div. 2) The Shortest Statement

Codeforces Round #511 (Div. 2) C. Enlarge GCD

POJ 3694 (tarjan缩点+LCA+并查集)

Hdu5921 Binary Indexed Tree