dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1482	P1363F Rotating Substrings dp strings *2600	0 / 0	(None)
	1465	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(None)
	1464	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
	1463	P1366G Construct the String data structures dp strings *2700	0 / 0	(None)
	1458	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
	1457	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(None)
	1456	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(None)
	1448	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(None)
	1443	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
	1441	P1369F BareLee dfs and similar dp games *2700	0 / 0	(None)
	1437	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(None)
	1428	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(None)
	1423	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(None)
	1422	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(None)
	1417	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(None)
	1416	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(None)
	1395	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(None)
	1393	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(None)
	1388	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(None)
	1385	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(None)

Pick a problem randomly based on the current filter.