runxinzhi.com
首页
百度搜索
proxysql on github
https://github.com/sysown/proxysql/wiki
相关阅读:
680C. Bear and Prime 100 数学
Codeforces 681C. Heap Operations 优先队列
Codeforces C. NP-Hard Problem 搜索
Codeforces 689C. Mike and Chocolate Thieves 二分
Codeforces 689B. Mike and Shortcuts SPFA/搜索
Codeforces Round #223 (Div. 2) E. Sereja and Brackets 线段树区间合并
Educational Codeforces Round 1 E. Chocolate Bar dp
Testing Round #12 A,B,C 讨论,贪心,树状数组优化dp
Educational Codeforces Round 2 E. Lomsat gelral 启发式合并map
hdu 3706 Second My Problem First 单调队列
原文地址:https://www.cnblogs.com/DataArt/p/10089832.html
最新文章
ZOJ Problem Set
TIANKENG’s restaurant
Educational Codeforces Round 5 B
Educational Codeforces Round 5 A
Good Bye 2015B
Good Bye 2015 A
hihoCoder #1871 : Heshen's Account Book-字符串暴力模拟 自闭(getline()函数) (ACM-ICPC Asia Beijing Regional Contest 2018 Reproduction B) 2018 ICPC 北京区域赛现场赛B
hihoCoder #1870 : Jin Yong’s Wukong Ranking List-闭包传递(递归) (ACM-ICPC Asia Beijing Regional Contest 2018 Reproduction A) 2018 ICPC 北京区域赛现场赛A
洛谷 P3128 [USACO15DEC]最大流Max Flow-树上差分(点权/点覆盖)(模板题)
2018 icpc 徐州现场赛G-树上差分+组合数学-大佬的代码
热门文章
洛谷 P3919 【模板】可持久化数组(可持久化线段树/平衡树)-可持久化线段树(单点更新,单点查询)
HDU 4348.To the moon SPOJ
HDU 5514.Frogs-欧拉函数 or 容斥原理
HDU 4417.Super Mario-可持久化线段树(无修改区间小于等于H的数的个数)
HDU 2665.Kth number-可持久化线段树(无修改区间第K小)模板 (POJ 2104.K-th Number 、洛谷 P3834 【模板】可持久化线段树 1(主席树)只是输入格式不一样,其他几乎都一样的)
Codeforces 709B 模拟
Codeforces 677C. Coloring Trees dp
Codeforces 631C. Report 模拟
Codeforces 703B. Mishka and trip 模拟
Codeforces 677C. Vanya and Label 位操作
Copyright © 2020-2023
润新知