two pointers - 题库 - bzoj.org

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	3130	P1209G1 Into Blocks (easy version) data structures dsu greedy implementation two pointers *2000	0 / 0	7
	3047	P1223D Sequence Sorting dp greedy two pointers *2000	0 / 0	7
	3041	P1225B2 TV Subscriptions (Hard Version) implementation two pointers *1300	0 / 0	4
	3002	P1237B Balanced Tunnel data structures sortings two pointers *1300	0 / 0	4
	2968	P1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	7
	2940	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	2932	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	2930	P1251C Minimize The Integer greedy two pointers *1600	0 / 0	5
	2921	P1252E Songwriter greedy two pointers *2200	0 / 0	8
	2906	P1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	6
	2905	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	2890	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	2889	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	2864	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	4
	2859	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	2815	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	8
	2782	P1282C Petya and Exam greedy sortings two pointers *1800	0 / 0	6
	2762	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	2744	P1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	6
	2668	P1304C Air Conditioner dp greedy implementation sortings two pointers *1500	0 / 0	5
	2667	P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	6
	2662	P1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	4
	2631	P1312F Attack on Red Kingdom games two pointers *2500	0 / 0	9
	2624	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	2595	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	2581	P1326E Bombs data structures two pointers *2400	0 / 0	9
	2572	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	2540	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	5
	2537	P1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	8
	2525	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	2524	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	2521	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	5
	2495	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	6
	2490	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	4
	2489	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	5
	2447	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	5
	2437	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	4
	2428	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	6
	2393	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
	2389	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	3
	2387	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	2361	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
	2360	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	4
	2348	P1366B Shuffle math two pointers *1300	0 / 0	4
	2345	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	2337	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	2336	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	2324	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	4
	2302	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	10
	2290	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	4
	2288	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	9
	2275	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	2274	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	2267	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	2262	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	2260	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	2259	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	2255	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	2225	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	2201	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	2200	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	2189	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	10
	2180	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	2176	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	4
	2173	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	2168	P1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	6
	2165	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	2155	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	2150	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	2138	P1407C Chocolate Bunny constructive algorithms interactive math two pointers *1600	0 / 0	5
	2133	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	2132	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	2122	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	2111	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	2101	P1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	5
	2088	P1418F Equal Product data structures math number theory two pointers *3000	0 / 0	10
	2087	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	2082	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	2052	P1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	5
	2019	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2012	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	5
	2007	P1431B Polycarp and the Language of Gods special problem implementation two pointers 1400	0 / 0	4
	2001	P1431H Rogue-like Game special problem brute force greedy two pointers 2600	0 / 0	10
	1986	P1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	9
	1979	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	10
	1973	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	1954	P1443E Long Permutation brute force math two pointers *2400	0 / 0	9
	1942	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	10
	1933	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	1916	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	1902	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	1879	P1462A Favorite Sequence implementation two pointers *800	0 / 0	3
	1875	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	1874	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	1869	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	1835	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	5
	1833	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	1831	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	1827	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	1819	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5

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