dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	5355	P1353E K-periodic Garland brute force dp greedy *1900	0 / 0	(None)
	5359	P1354F Summoning Minions constructive algorithms dp flows graph matchings greedy sortings *2500	0 / 0	(None)
	5361	P1355B Young Explorers dp greedy sortings *1200	0 / 0	(None)
	5384	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	(None)
	5389	P1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(None)
	5390	P1360F Spy-string bitmasks brute force constructive algorithms dp hashing strings *1700	0 / 0	(None)
	5399	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(None)
	5400	P1363F Rotating Substrings dp strings *2600	0 / 0	(None)
	5411	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
	5412	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
	5413	P1366G Construct the String data structures dp strings *2700	0 / 0	(None)
	5416	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
	5417	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
	5423	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(None)
	5427	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
	5432	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
	5438	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
	5442	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(None)
	5446	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
	5460	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.