dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	9337	P1985H2 Maximize the Largest Component (Hard Version) data structures dfs and similar dp dsu implementation *2200	0 / 0	8
	9333	P1986D Mathematical Problem brute force dp greedy implementation math two pointers *1400	0 / 0	4
	9326	P1987C Basil's Garden dp greedy *1200	0 / 0	4
	9325	P1987D World is Mine dp games *1800	0 / 0	6
	9323	P1987F1 Interesting Problem (Easy Version) dp *2500	0 / 0	9
	9322	P1987F2 Interesting Problem (Hard Version) dp *2600	0 / 0	10
	9321	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10
	9320	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
	9389	P1988D The Omnipotent Monster Killer brute force dfs and similar dp trees	0 / 0	(None)
	9387	P1988F Heartbeat combinatorics dp fft math	0 / 0	(None)
	9315	P1989D Smithing Skill brute force data structures dp greedy math sortings two pointers *1900	0 / 0	6
	9314	P1989E Distance to Different combinatorics dp math *2300	0 / 0	8
	9404	P1990D Grid Puzzle bitmasks dp greedy math	0 / 0	(None)
	9383	P1992D Test of Love dp greedy implementation *1200	0 / 0	4
	9381	P1992F Valuable Cards brute force dp greedy number theory two pointers *1900	0 / 0	6
	9380	P1992G Ultra-Meow combinatorics dp math *2000	0 / 0	7
	9398	P1994C Hungry Games binary search dp two pointers	0 / 0	(None)
	9394	P1994G Minecraft bitmasks brute force dp math	0 / 0	(None)
	9410	P1995D Cases bitmasks dp strings	0 / 0	(None)
	9409	P1995E1 Let Me Teach You a Lesson (Easy Version) 2-sat data structures dp two pointers	0 / 0	(None)

Pick a problem randomly based on the current filter.