divide and conquer - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	486	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(None)
	419	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(None)
	376	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	(None)
	349	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(None)
	331	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	(None)
	329	P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	(None)
	268	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(None)
	259	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(None)
	222	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(None)
	190	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(None)
	176	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(None)
	168	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	(None)
	147	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(None)
	108	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	(None)
	66	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
	24	P1641E Special Positions combinatorics divide and conquer fft math *3300	0 / 0	(None)
	4	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees	0 / 0	(None)
	7621	P1654E Arithmetic Operations brute force data structures divide and conquer graphs math *2300	0 / 0	(None)
	7620	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)
	7716	P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	(None)

Pick a problem randomly based on the current filter.