Greedy thematic exercises
[ The APIO / CTSC 2007] Data Backup
CF280D k-Maximum Subsequence Sum
[ BZOJ1852] [MexicoOI06] The maximum length decreasing sequence of
Thematic techniques Summary:
1. greedy method: half, stack, etc. retracement
2. combined use: dp + greedy, segment tree data structure such as maintenance greedy