greedy - 题库 - oj

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1185	P1681A Game with Cards games greedy *800	0 / 0	3
	1179	P1682A Palindromic Indices greedy strings *800	0 / 0	3
	1177	P1682C LIS or Reverse LIS? constructive algorithms greedy implementation math *1400	0 / 0	4
	1175	P1682E Unordered Swaps constructive algorithms dfs and similar graphs greedy math sortings trees *2700	0 / 0	10
	1174	P1682F MCMF? data structures flows graphs greedy sortings two pointers *2700	0 / 0	10
	1171	P1684C Column Swapping brute force constructive algorithms greedy implementation sortings *1400	0 / 0	4
	1170	P1684D Traps constructive algorithms greedy sortings *1700	0 / 0	5
	1169	P1684E MEX vs DIFF binary search brute force constructive algorithms data structures greedy two pointers *2100	0 / 0	7
	1165	P1685A Circular Local MiniMax constructive algorithms greedy sortings *1100	0 / 0	3
	1164	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	7
	1163	P1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	10
	1161	P1685D2 Permutation Weight (Hard Version) constructive algorithms greedy *3500	0 / 0	10
	1160	P1685E The Ultimate LIS Problem data structures greedy *3500	0 / 0	10
	1159	P1686A Everything Everywhere All But One greedy *800	0 / 0	3
	1158	P1686B Odd Subarrays dp greedy *800	0 / 0	3
	1157	P1687A The Enchanted Forest brute force greedy *1600	0 / 0	5
	1156	P1687B Railway System constructive algorithms graphs greedy interactive sortings *1700	0 / 0	5
	1155	P1687C Sanae and Giant Robot binary search brute force data structures dsu greedy sortings *2500	0 / 0	9
	1153	P1687E Become Big For Me combinatorics constructive algorithms greedy math number theory *3500	0 / 0	10
	1150	P1688B Patchouli's Magical Talisman bitmasks constructive algorithms greedy sortings *800	0 / 0	3
	1149	P1688C Manipulating History constructive algorithms greedy strings *1700	0 / 0	5
	1148	P1689A Lex String brute force greedy implementation sortings two pointers *800	0 / 0	3
	1147	P1689B Mystic Permutation data structures greedy *900	0 / 0	3
	1143	P1690A Print a Pedestal (Codeforces logo?) constructive algorithms greedy *800	0 / 0	3
	1142	P1690B Array Decrements greedy implementation *800	0 / 0	3
	1141	P1690C Restoring the Duration of Tasks data structures greedy implementation *800	0 / 0	3
	1139	P1690E Price Maximization binary search greedy math two pointers *1500	0 / 0	5
	1137	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	7
	1136	P1691A Beat The Odds brute force greedy math *800	0 / 0	3
	1135	P1691B Shoe Shuffling constructive algorithms greedy implementation two pointers *1000	0 / 0	3
	1134	P1691C Sum of Substrings brute force constructive algorithms greedy math strings *1400	0 / 0	4
	1132	P1691E Number of Groups data structures dfs and similar dsu graphs greedy sortings *2300	0 / 0	8
	1129	P1692B All Distinct greedy sortings *800	0 / 0	3
	1123	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	1122	P1693A Directional Increase greedy *1300	0 / 0	4
	1121	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	1120	P1693C Keshi in Search of AmShZ graphs greedy shortest paths *2300	0 / 0	8
	1119	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	1118	P1693E Outermost Maximums data structures greedy *3400	0 / 0	10
	1117	P1693F I Might Be Wrong binary search greedy two pointers *3400	0 / 0	10
	1116	P1694A Creep greedy implementation *800	0 / 0	3
	1115	P1694B Paranoid String constructive algorithms greedy *1200	0 / 0	4
	1113	P1695B Circle Game games greedy *1000	0 / 0	3
	1112	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	1111	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	1110	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	1108	P1696A NIT orz! bitmasks greedy *800	0 / 0	3
	1107	P1696B NIT Destroys the Universe greedy *900	0 / 0	3
	1106	P1696C Fishingprince Plays With Array constructive algorithms greedy implementation math *1400	0 / 0	4
	1105	P1696D Permutation Graph binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900	0 / 0	6
	1101	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	1100	P1697A Parkway Walk greedy implementation *800	0 / 0	3
	1099	P1697B Promo greedy sortings *900	0 / 0	3
	1098	P1697C awoo's Favorite Problem binary search constructive algorithms data structures greedy implementation strings two pointers *1400	0 / 0	4
	1096	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	1093	P1698B Rising Sand constructive algorithms greedy implementation *800	0 / 0	3
	1090	P1698E PermutationForces II brute force combinatorics greedy sortings trees two pointers *2300	0 / 0	8
	1084	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	1083	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	1082	P1700A Optimal Path constructive algorithms greedy math *800	0 / 0	3
	1080	P1700C Helping the Nature constructive algorithms data structures greedy *1700	0 / 0	5
	1079	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	1077	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	1075	P1701B Permutation greedy *800	0 / 0	3
	1074	P1701C Schedule Management binary search greedy implementation two pointers *1400	0 / 0	4
	1073	P1701D Permutation Restoration binary search data structures greedy math sortings two pointers *1900	0 / 0	6
	1072	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	1069	P1702B Polycarp Writes a String from Memory greedy *800	0 / 0	3
	1068	P1702C Train and Queries data structures greedy *1100	0 / 0	3
	1067	P1702D Not a Cheap String greedy *1000	0 / 0	3
	1065	P1702F Equate Multisets constructive algorithms data structures greedy math number theory *1700	0 / 0	5
	1057	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	1056	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	1055	P1704A Two 0-1 Sequences constructive algorithms greedy *800	0 / 0	3
	1054	P1704B Luke is a Foodie brute force greedy implementation *1000	0 / 0	3
	1053	P1704C Virus greedy implementation sortings *1200	0 / 0	4
	1046	P1705A Mark the Photographer greedy sortings *800	0 / 0	3
	1045	P1705B Mark the Dust Sweeper constructive algorithms greedy implementation *900	0 / 0	3
	1043	P1705D Mark and Lightbulbs combinatorics constructive algorithms greedy math sortings *1800	0 / 0	6
	1042	P1705E Mark and Professor Koro binary search bitmasks brute force combinatorics data structures greedy *2300	0 / 0	8
	1040	P1706A Another String Minimization Problem 2-sat constructive algorithms greedy string suffix structures strings *800	0 / 0	3
	1039	P1706B Making Towers dp greedy math *1100	0 / 0	3
	1038	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	1037	P1706D1 Chopping Carrots (Easy Version) binary search brute force constructive algorithms greedy number theory *1700	0 / 0	5
	1036	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	1035	P1706E Qpwoeirut and Vertices binary search data structures dfs and similar divide and conquer dsu greedy trees *2300	0 / 0	8
	1034	P1707A Doremy's IQ binary search constructive algorithms greedy implementation *1600	0 / 0	5
	1032	P1707C DFS Trees dfs and similar dsu graphs greedy sortings trees *2400	0 / 0	9
	1028	P1708A Difference Operations greedy math *800	0 / 0	3
	1026	P1709A Three Doors brute force greedy implementation math *800	0 / 0	3
	1024	P1709C Recover an RBS constructive algorithms greedy implementation strings *1800	0 / 0	6
	1023	P1709D Rorororobot binary search data structures greedy math *1700	0 / 0	5
	1022	P1709E XOR Tree bitmasks data structures dfs and similar dsu greedy trees *2400	0 / 0	9
	1020	P1710A Color the Picture constructive algorithms greedy math *1500	0 / 0	5
	1019	P1710B Rain binary search brute force data structures geometry greedy implementation math *2100	0 / 0	7
	1018	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	1013	P1712A Wonderful Permutation greedy implementation *800	0 / 0	3
	1012	P1712B Woeful Permutation constructive algorithms greedy number theory *800	0 / 0	3
	1011	P1712C Sort Zero greedy sortings *1100	0 / 0	3
	1010	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	7

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