greedy - 题库 - 达芬奇编程

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1655	P1679A AvtoBus brute force greedy math number theory *900	0 / 0	3
	1647	P1680C Binary String binary search greedy strings two pointers *1600	0 / 0	5
	1646	P1680D Dog Walking brute force greedy math *2400	0 / 0	9
	1645	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	1643	P1681A Game with Cards games greedy *800	0 / 0	3
	1637	P1682A Palindromic Indices greedy strings *800	0 / 0	3
	1635	P1682C LIS or Reverse LIS? constructive algorithms greedy implementation math *1400	0 / 0	4
	1633	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	1632	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1629	P1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	4
	1628	P1684D Traps constructive algorithms greedy sortings *1700	0 / 0	5
	1627	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1623	P1685A Circular Local MiniMax constructive algorithms greedy sortings *1100	0 / 0	3
	1622	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1621	P1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	10
	1619	P1685D2 Permutation Weight (Hard Version) constructive algorithms greedy *3500	0 / 0	10
	1618	P1685E The Ultimate LIS Problem data structures greedy *3500	0 / 0	10
	1617	P1686A Everything Everywhere All But One greedy *800	0 / 0	3
	1616	P1686B Odd Subarrays dp greedy *800	0 / 0	3
	1615	P1687A The Enchanted Forest brute force greedy *1600	0 / 0	5
	1614	P1687B Railway System constructive algorithms graphs greedy interactive sortings *1700	0 / 0	5
	1613	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	9
	1611	P1687E Become Big For Me combinatorics constructive algorithms greedy math number theory *3500	0 / 0	10
	1608	P1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	3
	1607	P1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	5
	1606	P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	3
	1605	P1689B Mystic Permutation data structures greedy *900	0 / 0	3
	1601	P1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	3
	1600	P1690B Array Decrements greedy implementation *800	0 / 0	3
	1599	P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	3
	1597	P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	5
	1595	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1594	P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	1593	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	3
	1592	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1590	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1587	P1692B All Distinct greedy sortings *800	0 / 0	3
	1581	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	1580	P1693A Directional Increase greedy *1300	0 / 0	4
	1579	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1578	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1577	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1576	P1693E Outermost Maximums data structures greedy *3400	0 / 0	10
	1575	P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	10
	1574	P1694A Creep greedy implementation *800	0 / 0	3
	1573	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	4
	1571	P1695B Circle Game games greedy *1000	0 / 0	3
	1570	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1569	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1568	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1566	P1696A NIT orz! bitmasks greedy *800	0 / 0	3
	1565	P1696B NIT Destroys the Universe greedy *900	0 / 0	3
	1564	P1696C Fishingprince Plays With Array constructive algorithms greedy implementation math *1400	0 / 0	4
	1563	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	1559	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	1558	P1697A Parkway Walk greedy implementation *800	0 / 0	3
	1557	P1697B Promo greedy sortings *900	0 / 0	3
	1556	P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	4
	1554	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	1551	P1698B Rising Sand constructive algorithms greedy implementation *800	0 / 0	3
	1548	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	1542	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	1541	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	1540	P1700A Optimal Path constructive algorithms greedy math *800	0 / 0	3
	1538	P1700C Helping the Nature constructive algorithms data structures greedy *1700	0 / 0	5
	1537	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	1535	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	1533	P1701B Permutation greedy *800	0 / 0	3
	1532	P1701C Schedule Management binary search greedy implementation two pointers *1400	0 / 0	4
	1531	P1701D Permutation Restoration binary search data structures greedy math sortings two pointers *1900	0 / 0	6
	1530	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	1527	P1702B Polycarp Writes a String from Memory greedy *800	0 / 0	3
	1526	P1702C Train and Queries data structures greedy *1100	0 / 0	3
	1525	P1702D Not a Cheap String greedy *1000	0 / 0	3
	1523	P1702F Equate Multisets constructive algorithms data structures greedy math number theory *1700	0 / 0	5
	1515	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	1514	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	1513	P1704A Two 0-1 Sequences constructive algorithms greedy *800	0 / 0	3
	1512	P1704B Luke is a Foodie brute force greedy implementation *1000	0 / 0	3
	1511	P1704C Virus greedy implementation sortings *1200	0 / 0	4
	1504	P1705A Mark the Photographer greedy sortings *800	0 / 0	3
	1503	P1705B Mark the Dust Sweeper constructive algorithms greedy implementation *900	0 / 0	3
	1501	P1705D Mark and Lightbulbs combinatorics constructive algorithms greedy math sortings *1800	0 / 0	6
	1500	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	8
	1498	P1706A Another String Minimization Problem 2-sat constructive algorithms greedy string suffix structures strings *800	0 / 0	3
	1497	P1706B Making Towers dp greedy math *1100	0 / 0	3
	1496	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	1495	P1706D1 Chopping Carrots (Easy Version) binary search brute force constructive algorithms greedy number theory *1700	0 / 0	5
	1494	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	1493	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	1492	P1707A Doremy's IQ binary search constructive algorithms greedy implementation *1600	0 / 0	5
	1490	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	1486	P1708A Difference Operations greedy math *800	0 / 0	3
	1484	P1709A Three Doors brute force greedy implementation math *800	0 / 0	3
	1482	P1709C Recover an RBS constructive algorithms greedy implementation strings *1800	0 / 0	6
	1481	P1709D Rorororobot binary search data structures greedy math *1700	0 / 0	5
	1480	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	9
	1478	P1710A Color the Picture constructive algorithms greedy math *1500	0 / 0	5
	1477	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	1476	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9

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