dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5258	P1323A Even Subset Sum Problem brute force dp greedy implementation *800	0 / 0	(None)
	5261	P1324E Sleeping Schedule dp implementation *1700	0 / 0	(None)
	5262	P1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
	5270	P1326F2 Wise Men (Hard Version) bitmasks dp math *3200	0 / 0	(None)
	5274	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	(None)
	5277	P1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	(None)
	5290	P1332F Independent Set dfs and similar dp trees *2500	0 / 0	(None)
	5298	P1334F Strange Function binary search data structures dp greedy *2500	0 / 0	(None)
	5302	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	(None)
	5303	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	(None)
	5304	P1336A Linova and Kingdom dfs and similar dp greedy sortings trees *1600	0 / 0	(None)
	5313	P1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	(None)
	5314	P1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	(None)
	5324	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	(None)
	5327	P1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	(None)
	5330	P1345B Card Constructions binary search brute force dp math *1100	0 / 0	(None)
	5336	P1346I Pac-Man 2.0 special problem dp 2900	0 / 0	(None)
	5344	P1349F1 Slime and Sequences (Easy Version) dp fft math *3100	0 / 0	(None)
	5345	P1349F2 Slime and Sequences (Hard Version) dp fft math *3500	0 / 0	(None)
	5346	P1350B Orac and Models dp math number theory *1400	0 / 0	(None)

Pick a problem randomly based on the current filter.