two pointers - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	4090	P1209G1 Into Blocks (easy version) data structures dsu greedy implementation two pointers *2000	0 / 0	7
	4007	P1223D Sequence Sorting dp greedy two pointers *2000	0 / 0	7
	4001	P1225B2 TV Subscriptions (Hard Version) implementation two pointers *1300	0 / 0	4
	3962	P1237B Balanced Tunnel data structures sortings two pointers *1300	0 / 0	4
	3928	P1244E Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers *2000	0 / 0	7
	3900	P1250G Discarding Game dp greedy two pointers *2300	0 / 0	8
	3892	P1251A Broken Keyboard brute force strings two pointers *1000	0 / 0	3
	3890	P1251C Minimize The Integer greedy two pointers *1600	0 / 0	5
	3881	P1252E Songwriter greedy two pointers *2200	0 / 0	8
	3866	P1254B1 Send Boxes to Alice (Easy Version) constructive algorithms greedy math number theory ternary search two pointers *1800	0 / 0	6
	3865	P1254B2 Send Boxes to Alice (Hard Version) constructive algorithms greedy math number theory ternary search two pointers *2100	0 / 0	7
	3850	P1257C Dominated Subarray greedy implementation sortings strings two pointers *1200	0 / 0	4
	3849	P1257D Yet Another Monster Killing Problem binary search data structures dp greedy sortings two pointers *1700	0 / 0	5
	3824	P1265B Beautiful Numbers data structures implementation math two pointers *1300	0 / 0	4
	3819	P1266D Decreasing Debts constructive algorithms data structures graphs greedy implementation math two pointers *2000	0 / 0	7
	3775	P1272F Two Bracket Sequences dp strings two pointers *2200	0 / 0	8
	3742	P1282C Petya and Exam greedy sortings two pointers *1800	0 / 0	6
	3722	P1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	8
	3704	P1290B Irreducible Anagrams binary search constructive algorithms data structures strings two pointers *1800	0 / 0	6
	3628	P1304C Air Conditioner dp greedy implementation sortings two pointers *1500	0 / 0	5
	3627	P1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	6
	3622	P1305B Kuroni and Simple Strings constructive algorithms greedy strings two pointers *1200	0 / 0	4
	3591	P1312F Attack on Red Kingdom games two pointers *2500	0 / 0	9
	3584	P1313E Concatenation with intersection data structures hashing strings two pointers *2700	0 / 0	10
	3555	P1324D Pair of Topics binary search data structures sortings two pointers *1400	0 / 0	4
	3541	P1326E Bombs data structures two pointers *2400	0 / 0	9
	3532	P1327F AND Segments bitmasks combinatorics data structures dp two pointers *2500	0 / 0	9
	3500	P1333C Eugene and an array binary search data structures implementation two pointers *1700	0 / 0	5
	3497	P1333F Kate and imperfection greedy implementation math number theory sortings two pointers *2200	0 / 0	8
	3485	P1335E1 Three Blocks Palindrome (easy version) binary search brute force data structures dp two pointers *1700	0 / 0	5
	3484	P1335E2 Three Blocks Palindrome (hard version) brute force data structures dp two pointers *1800	0 / 0	6
	3481	P1336B Xenia and Colorful Gems binary search greedy math sortings two pointers *1700	0 / 0	5
	3455	P1342D Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers *1900	0 / 0	6
	3450	P1343C Alternating Subsequence dp greedy two pointers *1200	0 / 0	4
	3449	P1343D Constant Palindrome Sum brute force data structures greedy two pointers *1700	0 / 0	5
	3407	P1352E Special Elements brute force implementation two pointers *1500	0 / 0	5
	3397	P1354B Ternary String binary search dp implementation two pointers *1200	0 / 0	4
	3388	P1355C Count Triangles binary search implementation math two pointers *1800	0 / 0	6
	3353	P1358D The Best Vacation binary search brute force greedy implementation two pointers *1900	0 / 0	6
	3349	P1359B New Theatre Square brute force dp greedy implementation two pointers *1000	0 / 0	3
	3347	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	7
	3321	P1364A XXXXX brute force data structures number theory two pointers *1200	0 / 0	4
	3320	P1364B Most socially-distanced subsequence greedy two pointers *1300	0 / 0	4
	3308	P1366B Shuffle math two pointers *1300	0 / 0	4
	3305	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	7
	3297	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	7
	3296	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	9
	3284	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	4
	3262	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	10
	3250	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	4
	3248	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	9
	3235	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	7
	3234	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	8
	3227	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	7
	3222	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	5
	3220	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	9
	3219	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	10
	3215	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	5
	3185	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	5
	3161	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	10
	3160	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	6
	3149	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	10
	3140	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	9
	3136	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	4
	3133	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	8
	3128	P1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	6
	3125	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	10
	3115	P1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	9
	3110	P1404C Fixed Point Removal binary search constructive algorithms data structures greedy two pointers *2300	0 / 0	8
	3098	P1407C Chocolate Bunny constructive algorithms interactive math two pointers *1600	0 / 0	5
	3093	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	5
	3092	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	7
	3082	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	6
	3071	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	6
	3061	P1416A k-Amazing Numbers binary search data structures implementation two pointers *1500	0 / 0	5
	3048	P1418F Equal Product data structures math number theory two pointers *3000	0 / 0	10
	3047	P1418G Three Occurrences data structures divide and conquer hashing two pointers *2500	0 / 0	9
	3042	P1419D2 Sage's Birthday (hard version) binary search brute force constructive algorithms greedy sortings two pointers *1500	0 / 0	5
	3012	P1423K Lonely Numbers binary search math number theory two pointers *1600	0 / 0	5
	2979	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	9
	2972	P1430D String Deletion binary search data structures greedy two pointers *1700	0 / 0	5
	2967	P1431B Polycarp and the Language of Gods special problem implementation two pointers 1400	0 / 0	4
	2961	P1431H Rogue-like Game special problem brute force greedy two pointers 2600	0 / 0	10
	2946	P1436E Complicated Computations binary search data structures two pointers *2400	0 / 0	9
	2939	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	10
	2933	P1438E Yurii Can Do Everything binary search bitmasks brute force constructive algorithms divide and conquer two pointers *2500	0 / 0	9
	2914	P1443E Long Permutation brute force math two pointers *2400	0 / 0	9
	2902	P1446D2 Frequency Problem (Hard Version) data structures greedy two pointers *3000	0 / 0	10
	2893	P1450D Rating Compression binary search data structures greedy implementation two pointers *1800	0 / 0	6
	2876	P1452E Two Editorials brute force dp greedy sortings two pointers *2500	0 / 0	9
	2862	P1454F Array Partition binary search data structures greedy two pointers *2100	0 / 0	7
	2839	P1462A Favorite Sequence implementation two pointers *800	0 / 0	3
	2835	P1462E1 Close Tuples (easy version) binary search combinatorics math sortings two pointers *1500	0 / 0	5
	2834	P1462E2 Close Tuples (hard version) binary search combinatorics implementation math sortings two pointers *1700	0 / 0	5
	2829	P1463D Pairs binary search constructive algorithms greedy two pointers *1900	0 / 0	6
	2795	P1469C Building a Fence dp greedy implementation two pointers *1600	0 / 0	5
	2793	P1469E A Bit Similar bitmasks brute force hashing string suffix structures strings two pointers *2400	0 / 0	9
	2791	P1470A Strange Birthday Party binary search dp greedy sortings two pointers *1300	0 / 0	4
	2787	P1470E Strange Permutation binary search combinatorics data structures dp graphs implementation two pointers *3200	0 / 0	10
	2779	P1472E Correct Placement binary search data structures dp sortings two pointers *1700	0 / 0	5

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