dp - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1569	P1363F Rotating Substrings dp strings *2600	0 / 0	(无)
	1552	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(无)
	1551	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(无)
	1550	P1366G Construct the String data structures dp strings *2700	0 / 0	(无)
	1545	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(无)
	1544	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(无)
	1543	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(无)
	1535	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(无)
	1530	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(无)
	1528	P1369F BareLee dfs and similar dp games *2700	0 / 0	(无)
	1524	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(无)
	1515	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(无)
	1510	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(无)
	1509	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(无)
	1504	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(无)
	1503	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(无)
	1482	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(无)
	1480	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(无)
	1475	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(无)
	1472	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(无)
	1468	P1381B Unmerge dp *1800	0 / 0	(无)
	1466	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(无)
	1463	P1382B Sequential Nim dp games *1100	0 / 0	(无)
	1461	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(无)
	1460	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(无)
	1458	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(无)
	1455	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(无)
	1454	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(无)
	1450	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(无)
	1443	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(无)
	1442	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(无)
	1440	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	(无)
	1433	P1389B Array Walk brute force dp greedy *1600	0 / 0	(无)
	1432	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(无)
	1429	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(无)
	1428	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(无)
	1425	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(无)
	1424	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(无)
	1419	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(无)
	1416	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(无)
	1415	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(无)
	1410	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(无)
	1409	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(无)
	1408	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(无)
	1407	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(无)
	1404	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(无)
	1400	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	(无)
	1397	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	(无)
	1390	P1398C Good Subarrays data structures dp math *1600	0 / 0	(无)
	1389	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(无)
	1387	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(无)
	1379	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(无)
	1374	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(无)
	1373	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(无)
	1372	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	(无)
	1368	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(无)
	1363	P1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(无)
	1360	P1403C Chess Rush special problem combinatorics dp implementation math 3200	0 / 0	(无)
	1358	P1404B Tree Tag dfs and similar dp games trees *1900	0 / 0	(无)
	1351	P1406B Maximum Product brute force dp greedy implementation sortings *1200	0 / 0	(无)
	1344	P1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	(无)
	1343	P1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(无)
	1340	P1408C Discrete Acceleration binary search dp implementation math two pointers *1500	0 / 0	(无)
	1339	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(无)
	1336	P1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(无)
	1334	P1408I Bitwise Magic dp math *3200	0 / 0	(无)
	1329	P1409E Two Platforms binary search dp sortings two pointers *1800	0 / 0	(无)
	1328	P1409F Subsequences of Length Two dp strings *2100	0 / 0	(无)
	1318	P1413C Perform Easily binary search brute force dp implementation sortings two pointers *1900	0 / 0	(无)
	1312	P1415C Bouncing Ball brute force dp implementation *1400	0 / 0	(无)
	1309	P1415F Cakes for Clones dp *2900	0 / 0	(无)
	1306	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(无)
	1304	P1416E Split binary search data structures dp greedy *3200	0 / 0	(无)
	1298	P1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	(无)
	1284	P1420C1 Pokémon Army (easy version) constructive algorithms dp greedy *1300	0 / 0	(无)
	1283	P1420C2 Pokémon Army (hard version) data structures divide and conquer dp greedy implementation *2100	0 / 0	(无)
	1281	P1420E Battle Lemmings dp greedy *2500	0 / 0	(无)
	1276	P1421E Swedish Heroes brute force dp implementation *2700	0 / 0	(无)
	1273	P1422C Bargain combinatorics dp math *1700	0 / 0	(无)
	1271	P1422E Minlexes dp greedy implementation strings *2700	0 / 0	(无)
	1260	P1423J Bubble Cup hypothesis bitmasks constructive algorithms dp math *2400	0 / 0	(无)
	1252	P1425B Blue and Red of Our Faculty! divide and conquer dp *2600	0 / 0	(无)
	1250	P1425D Danger of Mad Snakes combinatorics dp math *2300	0 / 0	(无)
	1240	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	(无)
	1237	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	(无)
	1226	P1428F Fruit Sequences binary search data structures divide and conquer dp two pointers *2400	0 / 0	(无)
	1225	P1428G1 Lucky Numbers (Easy Version) dp greedy *2900	0 / 0	(无)
	1224	P1428G2 Lucky Numbers (Hard Version) dp greedy *3000	0 / 0	(无)
	1217	P1430F Realistic Gameplay dp greedy *2600	0 / 0	(无)
	1216	P1430G Yet Another DAG Problem bitmasks dfs and similar dp flows graphs math *2600	0 / 0	(无)
	1209	P1431G Number Deletion Game special problem dp games greedy 2100	0 / 0	(无)
	1206	P1431J Zero-XOR Array special problem dp 3400	0 / 0	(无)
	1200	P1433F Zero Remainder Sum dp *2100	0 / 0	(无)
	1189	P1437C Chef Monocarp dp flows graph matchings greedy math sortings *1800	0 / 0	(无)
	1187	P1437E Make It Increasing binary search constructive algorithms data structures dp implementation *2200	0 / 0	(无)
	1186	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	(无)
	1174	P1439D INOI Final Contests combinatorics dp fft *3100	0 / 0	(无)
	1170	P1442A Extreme Subtraction constructive algorithms dp greedy *1800	0 / 0	(无)
	1167	P1442D Sum data structures divide and conquer dp greedy *2800	0 / 0	(无)
	1166	P1442E Black, White and Grey Tree binary search constructive algorithms dfs and similar dp greedy trees *3000	0 / 0	(无)

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