divide and conquer - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	2907	P1100F Ivan and Burgers data structures divide and conquer greedy math *2500	0 / 0	(无)
	2845	P1111C Creative Snap binary search brute force divide and conquer math *1700	0 / 0	(无)
	2835	P1114F Please, another Queries on Array? bitmasks data structures divide and conquer math number theory *2400	0 / 0	(无)
	2735	P1139F Dish Shopping data structures divide and conquer *2500	0 / 0	(无)
	2730	P1140E Palindrome-less Arrays combinatorics divide and conquer dp *2200	0 / 0	(无)
	2729	P1140F Extending Set of Points data structures divide and conquer dsu *2600	0 / 0	(无)
	2728	P1140G Double Tree data structures divide and conquer shortest paths trees *2700	0 / 0	(无)
	2693	P1146E Hot is Cold bitmasks data structures divide and conquer implementation *2400	0 / 0	(无)
	2639	P1155D Beautiful Array brute force data structures divide and conquer dp greedy *1900	0 / 0	(无)
	2633	P1156D 0-1-Tree dfs and similar divide and conquer dp dsu trees *2200	0 / 0	(无)
	2632	P1156E Special Segments of Permutation data structures divide and conquer dsu two pointers *2200	0 / 0	(无)
	2588	P1167B Lost Numbers brute force divide and conquer interactive math *1400	0 / 0	(无)
	2552	P1174F Ehab and the Big Finale constructive algorithms divide and conquer graphs implementation interactive trees *2400	0 / 0	(无)
	2547	P1175E Minimal Segment Cover data structures dfs and similar divide and conquer dp greedy implementation trees *2200	0 / 0	(无)
	2546	P1175F The Number of Subpermutations brute force data structures divide and conquer hashing math *2500	0 / 0	(无)
	2545	P1175G Yet Another Partiton Problem data structures divide and conquer dp geometry two pointers *3000	0 / 0	(无)
	2537	P1177B Digits Sequence (Hard Edition) binary search divide and conquer implementation *1800	0 / 0	(无)
	2523	P1179E Alesya and Discrete Math divide and conquer interactive *3200	0 / 0	(无)
	2516	P1181E1 A Story of One Country (Easy) brute force divide and conquer sortings *2500	0 / 0	(无)
	2474	P1186E Vus the Cossack and a Field divide and conquer implementation math *2500	0 / 0	(无)
	2453	P1190D Tokitsukaze and Strange Rectangle data structures divide and conquer sortings two pointers *2000	0 / 0	(无)
	2447	P1192B Dynamic Diameter *special problem data structures dfs and similar divide and conquer trees	0 / 0	(无)
	2318	P1213G Path Queries divide and conquer dsu graphs sortings trees *1800	0 / 0	(无)
	2291	P1217F Forced Online Queries Problem data structures divide and conquer dsu graphs trees *2600	0 / 0	(无)
	2287	P1218D Xor Spanning Tree divide and conquer fft graphs *2400	0 / 0	(无)
	2286	P1218E Product Tuples divide and conquer fft *2500	0 / 0	(无)
	2260	P1223F Stack Exterminable Arrays data structures divide and conquer dp hashing *2600	0 / 0	(无)
	2215	P1237C2 Balanced Removals (Harder) binary search constructive algorithms divide and conquer greedy implementation sortings *1900	0 / 0	(无)
	2149	P1250M SmartGarden constructive algorithms divide and conquer *2500	0 / 0	(无)
	2101	P1257G Divisor Set divide and conquer fft greedy math number theory *2600	0 / 0	(无)
	2094	P1261F Xor-Set bitmasks divide and conquer math *3100	0 / 0	(无)
	2054	P1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(无)
	2008	P1278E Tests for problem D constructive algorithms dfs and similar divide and conquer trees *2200	0 / 0	(无)
	1970	P1285D Dr bitmasks brute force dfs and similar divide and conquer dp greedy strings trees *1900	0 / 0	(无)
	1925	P1295E Permutation Separation data structures divide and conquer *2200	0 / 0	(无)
	1878	P1303G Sum of Prefix Sums data structures divide and conquer geometry trees *2700	0 / 0	(无)
	1844	P1311F Moving Points data structures divide and conquer implementation sortings *1900	0 / 0	(无)
	1822	P1316F Battalion Strength data structures divide and conquer probabilities *2800	0 / 0	(无)
	1723	P1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(无)
	1718	P1338C Perfect Triples bitmasks brute force constructive algorithms divide and conquer math *2200	0 / 0	(无)
	1564	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(无)
	1514	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(无)
	1508	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(无)
	1504	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(无)
	1501	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(无)
	1486	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(无)
	1480	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(无)
	1478	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(无)
	1450	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(无)
	1444	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(无)
	1374	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(无)
	1337	P1408F Two Different constructive algorithms divide and conquer *2300	0 / 0	(无)
	1306	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(无)
	1294	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	(无)
	1283	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(无)
	1267	P1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(无)
	1262	P1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(无)
	1252	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	(无)
	1226	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(无)
	1180	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	(无)
	1175	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	(无)
	1167	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(无)
	1151	P1446C Xor Tree binary search bitmasks data structures divide and conquer dp trees *2100	0 / 0	(无)
	1089	P1461D Divide and Summarize binary search brute force data structures divide and conquer implementation sortings *1600	0 / 0	(无)
	1066	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	(无)
	1033	P1470F Strange Covering divide and conquer *3500	0 / 0	(无)
	969	P1482E Skyline Photo data structures divide and conquer dp *2100	0 / 0	(无)
	932	P1490D Permutation Transformation dfs and similar divide and conquer implementation *1200	0 / 0	(无)
	924	P1491E Fib-tree brute force dfs and similar divide and conquer number theory trees *2400	0 / 0	(无)
	905	P1494D Dogeforces constructive algorithms data structures dfs and similar divide and conquer dsu greedy sortings trees *2300	0 / 0	(无)
	861	P1503F Balance the Cards constructive algorithms data structures divide and conquer geometry graphs implementation *3500	0 / 0	(无)
	750	P1523G Try Booking data structures divide and conquer *3200	0 / 0	(无)
	730	P1527E Partition Game binary search data structures divide and conquer dp *2500	0 / 0	(无)
	729	P1528A Parsa's Humongous Tree dfs and similar divide and conquer dp greedy trees *1600	0 / 0	(无)
	629	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(无)
	614	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(无)
	611	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(无)
	607	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(无)
	599	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(无)
	574	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(无)
	573	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(无)
	506	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(无)
	463	P1575L Longest Array Deconstruction data structures divide and conquer dp sortings *2100	0 / 0	(无)
	436	P1580D Subsequence brute force divide and conquer dp greedy trees *2900	0 / 0	(无)
	418	P1583F Defender of Childhood Dreams bitmasks constructive algorithms divide and conquer *2500	0 / 0	(无)
	416	P1583H Omkar and Tours data structures divide and conquer sortings trees *3300	0 / 0	(无)
	355	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(无)
	346	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(无)
	309	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(无)
	277	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(无)
	263	P1615H Reindeer Games binary search constructive algorithms data structures divide and conquer flows graphs shortest paths *3000	0 / 0	(无)
	255	P1616H Keep XOR Low bitmasks combinatorics data structures divide and conquer dp math *3000	0 / 0	(无)
	234	P1619H Permutation and Queries brute force data structures divide and conquer two pointers *2400	0 / 0	(无)
	195	P1625E1 Cats on the Upgrade (easy version) brute force data structures dfs and similar divide and conquer dp graphs trees *2500	0 / 0	(无)
	153	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(无)
	111	P1641E Special Positions combinatorics divide and conquer fft math *3300	0 / 0	(无)
	86	P1648D Serious Business data structures divide and conquer dp implementation shortest paths *2800	0 / 0	(无)
	85	P1648E Air Reform data structures dfs and similar divide and conquer dsu graphs implementation trees *3200	0 / 0	(无)
	63	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(无)
	61	P1654H Three Minimums combinatorics constructive algorithms divide and conquer dp fft math *3500	0 / 0	(无)

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