Codeforces Round #379 (Div. 2) C. Anton and Making Potions 前缀最小值+贪心+二分搜索
C. Anton and Making Potions 前缀最小值+贪心+二分搜索 Source Codeforces Round #379 (Div. 2) &…
Codeforces Round #377 (Div. 2) D. Exams 二分+贪心 or 纯贪心水过
D. Exams 二分+贪心 or 纯贪心水过 Source Codeforces Round #377 (Div. 2) My Solution &n…
Codeforces Round #378 (Div. 2) D. Kostya the Sculptor __ data structures、map>
D. Kostya the Sculptor data structures Source Codeforces Round #378 (Div. 2) My Solut…
Codeforces Round #378 (Div. 2) C. Epidemic in Monstropolis 贪心+构造
C. Epidemic in Monstropolis 贪心+构造 Source Codeforces Round #378 (Div. 2) My Soluti…
Codeforces Round #376 (Div. 2) C. Socks 并查集+贪心、图论
C. Socks 并查集+贪心、图论 Source Codeforces Round #376 (Div. 2) My Solution 并查集+…
Codeforces Round #377 (Div. 2) C. Sanatorium 分类讨论
C. Sanatorium 分类讨论 Source Codeforces Round #377 (Div. 2) My Solution 题意：总共有…
Codeforces Round #375 (Div. 2) C. Polycarp at the Radio 贪心+排序
C. Polycarp at the Radio 贪心+排序 Source Codeforces Round #375 (Div. 2) My Solution …
Codeforces Round #375 (Div. 2) D. Lakes in Berland __ dfs+贪心+小根堆
D. Lakes in Berland dfs+贪心+小根堆 Source Codeforces Round #375 (Div. 2) My Solution…
Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined) D. Dense Subsequence ST表+贪心
D. Dense Subsequence ST表+贪心 My Solution ST表+贪心 ST表，用O(nlogn)的预处理，然后O(1)查询，…
Intel Code Challenge Elimination Round (Div.1 + Div.2, combined) D. Generating Sets __ dfs+优先队列+贪心
D. Generating Sets dfs+优先队列+贪心 My Solution dfs+优先队列+贪心 向把数读入到priority_queue…
