dp - 题库 - Turing

ID	题目显示标签隐藏标签	AC / 尝试	难度
240	CODEFORCESP331 Make It Increasing binary search constructive algorithms data structures dp implementation *2200	1 / 60	10
857	CODEFORCESP839 Young Explorers dp greedy sortings *1200	0 / 0	(无)
1093	CODEFORCESP2599 Equalize （※※） dp greedy strings *1300 translated	15 / 75	7
909	CODEFORCESP3789 Odd sum dp greedy implementation *1400	17 / 90	8
1392	CODEFORCESP7266 Game brute force dp implementation *1800	6 / 42	8
1190	CODEFORCESP7306 Phone Number dp *1700	0 / 0	(无)
1179	CODEFORCESP7444 Bargaining Table（谈判桌） brute force dp *1500 待翻译 translated 已润色	4 / 7	10
326	CODEFORCESP7535 Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900 translated	0 / 0	(无)
770	P770 迪马和错误的异或 bitmasks brute force constructive algorithms dp *1600 b 普及组 translated	1 / 5	10
732	P987C Three displays （※※） brute force dp implementation *1400 b translated	10 / 29	6
195	P1387 最大正方形动态规划 dp 福建省历届夏令营枚举前缀和	8 / 18	7
806	P1475B New Year's Number（※） brute force dp math *900 translated	15 / 35	5
949	P1856C # To Become Max binary search brute force data structures dp	0 / 0	(无)

根据当前过滤条件随机选择一道题

分类