dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5466	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(None)
	5468	P1381B Unmerge dp *1800	0 / 0	(None)
	5469	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	5472	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
	5475	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
	5476	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
	5479	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	5484	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(None)
	5491	P1389B Array Walk brute force dp greedy *1600	0 / 0	(None)
	5493	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(None)
	5495	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(None)
	5496	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	5499	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(None)
	5502	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(None)
	5505	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(None)
	5506	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(None)
	5513	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	(None)
	5519	P1398C Good Subarrays data structures dp math *1600	0 / 0	(None)
	5521	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(None)
	5530	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.