divide and conquer - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	9323	P1922E Increasing Subsequences bitmasks constructive algorithms divide and conquer dp greedy implementation math	1 / 7	10
	9395	P1923E Count Paths data structures dfs and similar divide and conquer dp graphs trees	1 / 2	10
	9416	P1936E Yet Yet Another Permutation Problem divide and conquer fft math	0 / 0	(无)
	9508	P1952F Grid brute force divide and conquer matrices	0 / 0	(无)
	9595	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	9586	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	9561	P1968G2 Division + LCP (hard version) binary search brute force data structures divide and conquer dp dsu hashing math string suffix structures strings	0 / 0	(无)
	9556	P1969E Unique Array binary search data structures divide and conquer dp greedy	0 / 0	(无)
	9624	P1975F Set bitmasks brute force dfs and similar divide and conquer dp math	0 / 0	(无)
	9717	P1982E Number of k-good subarrays bitmasks combinatorics divide and conquer dp math meet-in-the-middle	0 / 0	(无)
	9741	P1983D Swap Dilemma constructive algorithms data structures divide and conquer greedy math sortings	0 / 0	(无)
	9729	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees	0 / 0	(无)
	9722	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10
	9766	P1990F Polygonal Segments data structures divide and conquer two pointers	0 / 0	(无)
	9788	P1997E Level Up binary search brute force data structures divide and conquer implementation	0 / 0	(无)
	9849	P1998E1 Eliminating Balls With Merging (Easy Version) binary search brute force data structures divide and conquer greedy *2200	0 / 0	8
	9848	P1998E2 Eliminating Balls With Merging (Hard Version) binary search brute force data structures divide and conquer greedy implementation *2500	0 / 0	9
	9837	P2001C Guess The Tree binary search brute force dfs and similar divide and conquer dsu greedy interactive trees *1500	0 / 0	5

根据当前过滤条件随机选择一道题