-
好题
-
Codeforces Round #821 (Div. 2)
- Consecutive Sum: 构造+数学
- Rule of League: 构造
- Parity Shuffle Sorting: 构造
- Zero-One (Easy Version): 构造+贪心
- (good) Zero-One (Hard Version): 动态规划。
- 好题,不是很难但是很考验细心,以及怎么快速实现。
- 一开始就想到了记忆化搜搜+倒推,但是比赛时候来不及推导出所有状态转移了。赛后试了下结果TLE了。
- 其实这题正向来写更简单:循环当前valid的状态,循环所有转移方法,计算出下一步valid的所有状态。
- 用一些贪心性质还可以把这题写成O(N)。希望以后提提速可以把div 2的E在赛场上做出来。
09/25/2022 | Codeforces Round #823 (Div. 2) | Planets | Meeting on the Line | Minimum Notation | Prefixes and Suffixes | Maximums and Minimums | |
1730 | 构造 | ||||||
09/24/2022 | 第 312 场周赛 | 按身高排序 | 按位与最大的最长子数组 | 找到所有好下标 | 好路径的数目 | ||
cmp in sort (A=B and B=A) shouldn’t happen | |||||||
09/24/2022 | Codeforces Round #822 (Div. 2) | Select Three Sticks | Bright, Nice, Brilliant | Removing Smallest Multiples | Slime Escape | ||
1734 (virtual) | |||||||
09/22/2022 | Codeforces Round #821 (Div. 2) | Consecutive Sum | Rule of League | Parity Shuffle Sorting | Zero-One (Easy Version) | Zero-One (Hard Version) | Conveyor |
1733 | good dp 博弈 正向dp |