divide and conquer - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	7938	P1691D Max GEQ Sum binary search constructive algorithms data structures divide and conquer implementation two pointers *1800	0 / 0	(无)
	7993	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(无)
	8001	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	(无)
	7978	P1700E Serega the Pirate brute force constructive algorithms divide and conquer *2600	0 / 0	(无)
	8123	P1715E Long Way Home data structures divide and conquer dp graphs shortest paths	2 / 5	10
	8088	P1716E Swap and Maximum Block bitmasks brute force data structures divide and conquer dp *2500	1 / 3	9
	8130	P1721D Maximum AND bitmasks divide and conquer greedy sortings	0 / 0	(无)
	8188	P1734F Zeros and Ones bitmasks divide and conquer dp math	0 / 0	(无)
	8288	P1740I Arranging Crystal Balls data structures divide and conquer dp geometry graphs number theory	0 / 0	(无)
	8311	P1748E Yet Another Array Counting Problem combinatorics data structures divide and conquer dp trees *2300	0 / 0	8
	8305	P1750E Bracket Cost data structures divide and conquer greedy strings	0 / 0	(无)
	8387	P1766E Decomposition brute force divide and conquer dp matrices	0 / 0	(无)
	8421	P1770G Koxia and Bracket divide and conquer fft math	0 / 0	(无)
	8378	P1773B BinCoin divide and conquer hashing implementation probabilities trees *2200	0 / 0	8
	8489	P1777F Comfortably Numb binary search bitmasks data structures divide and conquer dsu strings trees two pointers	0 / 0	(无)
	8442	P1783G Weighed Tree Radius data structures divide and conquer trees	0 / 0	(无)
	8516	P1787I Treasure Hunt divide and conquer two pointers	0 / 0	(无)
	8510	P1790F Timofey and Black-White Tree brute force dfs and similar divide and conquer graphs greedy shortest paths trees	0 / 0	(无)
	8554	P1793F Rebrending brute force data structures divide and conquer dp implementation	1 / 1	10
	8598	P1794D Counting Factorizations combinatorics divide and conquer dp fft math number theory	0 / 0	(无)
	8593	P1796D Maximum Subarray data structures divide and conquer dp greedy math two pointers *2000	0 / 0	7
	8606	P1801E Gasoline prices data structures divide and conquer dsu hashing trees	1 / 2	10
	8613	P1804F Approximate Diameter binary search divide and conquer graphs shortest paths	0 / 0	(无)
	8648	P1808E2 Minibuses on Venus (medium version) combinatorics divide and conquer dp matrices *2500	0 / 0	9
	8687	P1814F Communication Towers brute force divide and conquer dsu	0 / 0	(无)
	8732	P1817E Half-sum brute force divide and conquer greedy *3400	0 / 0	10
	8816	P1841E Fill the Matrix data structures divide and conquer greedy math sortings	0 / 0	(无)
	8842	P1842I Tenzing and Necklace divide and conquer dp greedy *3500	0 / 0	10
	8880	P1848F Vika and Wiki binary search bitmasks combinatorics divide and conquer dp math	0 / 0	(无)
	8910	P1849E Max to the Right of Min binary search data structures divide and conquer dp dsu two pointers	0 / 0	(无)
	8909	P1849F XOR Partition binary search bitmasks data structures divide and conquer greedy sortings trees	0 / 0	(无)
	8940	P1856D More Wrong divide and conquer interactive	0 / 0	(无)
	8951	P1859F Teleportation in Byteland data structures divide and conquer graphs shortest paths trees	0 / 0	(无)
	8980	P1864E Guess Game bitmasks combinatorics constructive algorithms data structures divide and conquer games math strings trees	0 / 0	(无)
	9025	P1868C Travel Plan combinatorics divide and conquer dp math trees	0 / 0	(无)
	9052	P1879D Sum of XOR Functions bitmasks combinatorics divide and conquer dp math *1700	0 / 0	5
	9105	P1887D Split binary search data structures divide and conquer dsu math trees two pointers	0 / 0	(无)
	9176	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory	0 / 0	(无)
	9157	P1898F Vova Escapes the Matrix dfs and similar divide and conquer shortest paths	1 / 1	10
	9211	P1902F Trees and XOR Queries Again data structures dfs and similar divide and conquer graphs implementation math trees *2400	0 / 0	9
	9241	P1904D2 Set To Max (Hard Version) constructive algorithms data structures divide and conquer greedy implementation sortings	0 / 0	(无)
	9246	P1905F Field Should Not Be Empty brute force data structures divide and conquer	0 / 0	(无)
	9200	P1906K Deck-Building Game divide and conquer math *2500	0 / 0	9
	9227	P1912B Blueprint for Seating combinatorics divide and conquer fft math *2000	0 / 0	7
	9285	P1913D Array Collapse data structures divide and conquer dp trees *2100	0 / 0	7
	9268	P1915F Greetings data structures divide and conquer sortings *1500	0 / 0	5
	9260	P1916G Optimizations From Chelsu divide and conquer dp number theory trees *3500	0 / 0	10
	9339	P1918E ace5 and Task Order binary search divide and conquer implementation interactive probabilities sortings	1 / 1	10
	9304	P1919D 01 Tree constructive algorithms data structures divide and conquer greedy implementation sortings trees *2100	1 / 2	7
	9308	P1921G Mischievous Shooter data structures divide and conquer dp implementation	0 / 1	10

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