dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	550	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	(None)
	549	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	(None)
	548	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	(None)
	537	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	(None)
	536	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	(None)
	535	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(None)
	528	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(None)
	526	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(None)
	523	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(None)
	518	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(None)
	513	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(None)
	512	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(None)
	505	P1551E Fixed Points binary search brute force dp *2000	0 / 0	(None)
	504	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(None)
	500	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(None)
	498	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(None)
	493	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	(None)
	492	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(None)
	491	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	(None)
	486	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(None)

Pick a problem randomly based on the current filter.