dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	2552	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(None)
	2550	P1155F Delivery Oligopoly brute force dp graphs *2800	0 / 0	(None)
	2546	P1156D 0-1-Tree dfs and similar divide and conquer dp dsu trees *2200	0 / 0	(None)
	2544	P1156F Card Bag dp math probabilities *2300	0 / 0	(None)
	2536	P1157F Maximum Balanced Circle constructive algorithms dp greedy two pointers *2000	0 / 0	(None)
	2529	P1158F Density of subarrays dp math *3500	0 / 0	(None)
	2518	P1163D Mysterious Code dp strings *2100	0 / 0	(None)
	2493	P1168C And Reachability bitmasks dp *2200	0 / 0	(None)
	2492	P1168D Anagram Paths dp implementation trees *3000	0 / 0	(None)
	2480	P1170I Good Subsets *special problem dp	0 / 0	(None)
	2478	P1172B Nauuo and Circle combinatorics dfs and similar dp trees *1900	0 / 0	(None)
	2477	P1172C1 Nauuo and Pictures (easy version) dp probabilities *2300	0 / 0	(None)
	2476	P1172C2 Nauuo and Pictures (hard version) dp probabilities *2600	0 / 0	(None)
	2466	P1174E Ehab and the Expected GCD Problem combinatorics dp math number theory *2500	0 / 0	(None)
	2460	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(None)
	2458	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(None)
	2455	P1176C Lose it! dp greedy implementation *1300	0 / 0	(None)
	2452	P1176F Destroy it! dp implementation sortings *2100	0 / 0	(None)
	2448	P1178B WOW Factor dp strings *1300	0 / 0	(None)
	2444	P1178F1 Short Colorful Strip combinatorics dfs and similar dp *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.