divide and conquer - 题库 - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	721	P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	8
	690	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	7
	678	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	667	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	7
	651	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	10
	646	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	9
	637	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	10
	609	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	564	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	559	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	10
	551	P1442D Sum data structures divide and conquer dp greedy *2800	1 / 1	10
	535	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	7
	473	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	5
	450	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	10
	417	P1470F Strange Covering divide and conquer *3500	0 / 0	10
	353	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	7
	316	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	4
	308	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	9
	289	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	8
	245	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	10
	80	P1523G Try Booking data structures divide and conquer *3200	1 / 1	10
	59	P1527E Partition Game binary search data structures divide and conquer dp *2500	1 / 1	9
	58	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	5
	7163	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	10
	7171	P1553H XOR and Distance bitmasks divide and conquer dp trees	0 / 0	(无)
	7170	P1553I Stairs combinatorics divide and conquer fft math	0 / 1	10
	7279	P1567E Non-Decreasing Dilemma data structures divide and conquer	0 / 0	(无)
	7343	P1575L Longest Array Deconstruction data structures divide and conquer dp	0 / 0	(无)
	7420	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer	0 / 0	(无)
	7358	P1592D Hemose in ICPC ? binary search dfs and similar divide and conquer interactive math number theory trees	0 / 0	(无)
	7439	P1601C Optimal Insertion data structures divide and conquer greedy	0 / 0	(无)
	7452	P1603D Artistic Partition divide and conquer dp implementation number theory *3000	1 / 1	10
	7442	P1606F Tree Queries binary search brute force data structures divide and conquer dp dsu geometry trees *2800	0 / 0	10
	7511	P1609E William The Oblivious data structures divide and conquer dp matrices *2400	0 / 0	9
	7510	P1609F Interesting Sections binary search data structures divide and conquer meet-in-the-middle *2800	0 / 0	10
	7557	P1615H Reindeer Games constructive algorithms data structures divide and conquer flows graphs shortest paths	0 / 0	(无)
	7576	P1616H Keep XOR Low bitmasks combinatorics divide and conquer dp math *3000	1 / 1	10
	7551	P1619F Let's Play the Hat? brute force constructive algorithms divide and conquer math	0 / 0	(无)
	7601	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees	0 / 0	(无)
	7693	P1641E Special Positions brute force combinatorics divide and conquer fft math	0 / 0	(无)
	7708	P1648D Serious Business data structures divide and conquer dp implementation shortest paths	0 / 0	(无)
	7707	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees	0 / 0	(无)
	7734	P1654E Arithmetic Operations brute force constructive algorithms divide and conquer graphs math *2300	1 / 1	8
	7733	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy sortings strings *2800	0 / 0	10
	7816	P1671E Preorder combinatorics divide and conquer dp dsu hashing sortings trees *2100	0 / 0	(无)
	7859	P1673F Anti-Theft Road Planning binary search bitmasks constructive algorithms divide and conquer greedy hashing interactive math	0 / 0	(无)
	7887	P1676H2 Maximum Crossings (Hard Version) brute force data structures divide and conquer sortings	0 / 0	(无)
	7896	P1680F Lenient Vertex Cover data structures dfs and similar divide and conquer dsu graphs	1 / 1	10
	7922	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees	1 / 1	10
	7908	P1684H Hard Cut constructive algorithms divide and conquer math *3400	0 / 0	(无)

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