divide and conquer - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	24	P1663B Mike's Sequence divide and conquer implementation math	0 / 0	(无)
	13	P1665E MinimizOR bitmasks brute force data structures divide and conquer greedy implementation two pointers *2500	0 / 0	(无)
	7743	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	(无)
	7726	P1673F Anti-Theft Road Planning bitmasks constructive algorithms divide and conquer greedy interactive math *2400	0 / 0	(无)
	7703	P1676H2 Maximum Crossings (Hard Version) data structures divide and conquer sortings *1500	0 / 0	(无)
	7770	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	(无)
	7762	P1684H Hard Cut constructive algorithms divide and conquer math *3400	0 / 0	(无)
	7830	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(无)
	7816	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(无)
	7933	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	(无)
	7795	P1700E Serega the Pirate brute force constructive algorithms divide and conquer *2600	0 / 0	(无)
	7884	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	(无)
	7988	P1715E Long Way Home binary search brute force chinese remainder theorem combinatorics constructive algorithms data structures dfs and similar divide and conquer dp dsu expression parsing flows games geometry graph matchings graphs greedy hashing implementation interactive math matrices number theory probabilities schedules shortest paths sortings string suffix structures strings ternary search trees two pointers	0 / 0	(无)
	7954	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	(无)
	8044	P1721D Maximum AND bitmasks dfs and similar divide and conquer greedy sortings *1800	0 / 0	(无)
	8061	P1730E Maximums and Minimums combinatorics data structures divide and conquer number theory *2700	0 / 0	(无)
	8054	P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	(无)
	8162	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	8150	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	8235	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8221	P1770G Koxia and Bracket divide and conquer fft math	0 / 0	(无)
	8195	P1773B BinCoin divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8261	P1783G Weighed Tree Radius data structures divide and conquer implementation trees	0 / 0	(无)
	8355	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	8356	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	8344	P1843F2 Omsk Metro (hard version) data structures dfs and similar divide and conquer dp math trees *2300	0 / 0	8
	8304	P1848F Vika and Wiki binary search bitmasks combinatorics divide and conquer dp math *2400	0 / 0	9
	8410	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers	0 / 0	(无)
	8409	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy trees	0 / 0	(无)
	8427	P1878G wxhtzdy ORO Tree binary search data structures dfs and similar divide and conquer trees	0 / 0	(无)
	8423	P1879D Sum of XOR Functions bitmasks combinatorics divide and conquer dp math *1700	0 / 0	5
	8586	P1887D Split binary search data structures divide and conquer dsu math trees two pointers	0 / 0	(无)
	8726	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	8699	P1902F Trees and XOR Queries Again data structures dfs and similar divide and conquer graphs implementation math trees *2400	0 / 0	9
	8695	P1903D2 Maximum And Queries (hard version) bitmasks divide and conquer dp greedy *2500	0 / 0	9
	8687	P1904D2 Set To Max (Hard Version) constructive algorithms data structures divide and conquer greedy implementation sortings	0 / 0	(无)
	8680	P1905F Field Should Not Be Empty brute force data structures divide and conquer	0 / 0	(无)
	8669	P1906K Deck-Building Game divide and conquer math *2500	0 / 0	9
	8647	P1912B Blueprint for Seating combinatorics divide and conquer math *2000	0 / 0	7
	8635	P1913D Array Collapse data structures divide and conquer dp trees	0 / 0	(无)
	8776	P1951E No Palindromes brute force constructive algorithms divide and conquer greedy hashing implementation math strings *2000	0 / 0	7
	8743	P1956D Nene and the Mex Operator bitmasks brute force constructive algorithms divide and conquer dp greedy implementation math *2000	0 / 0	7
	8894	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	8864	P1969E Unique Array binary search data structures divide and conquer dp greedy *2400	0 / 0	9
	8951	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	8946	P1976D Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers	0 / 0	(无)
	8998	P1982E Number of k-good subarrays bitmasks combinatorics data structures divide and conquer dp math meet-in-the-middle	0 / 0	(无)
	9049	P1983D Swap Dilemma constructive algorithms data structures divide and conquer greedy math sortings *1700	0 / 0	5
	9038	P1987G1 Spinning Round (Easy Version) divide and conquer dp trees *2900	0 / 0	10
	9037	P1987G2 Spinning Round (Hard Version) divide and conquer dp trees *3500	0 / 0	10
	9031	P1988E Range Minimum Sum binary search brute force data structures divide and conquer implementation	0 / 0	(无)
	9024	P1989F Simultaneous Coloring dfs and similar divide and conquer graphs *3000	0 / 0	10
	9083	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees *2600	0 / 0	10
	9082	P1990F Polygonal Segments brute force data structures divide and conquer dp greedy two pointers *2800	0 / 0	10
	9054	P1997E Level Up binary search brute force data structures divide and conquer implementation	0 / 0	(无)

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