dp - 题库 - bzoj.org

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	700	P1679E Typical Party in Dorm bitmasks combinatorics dp strings *2400	0 / 0	9
	699	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	10
	694	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	7
	689	P1681D Required Length brute force dfs and similar dp hashing shortest paths *1700	0 / 0	5
	688	P1681E Labyrinth Adventures data structures dp matrices shortest paths *2600	0 / 0	10
	687	P1681F Unique Occurrences data structures dfs and similar divide and conquer dp dsu trees *2300	0 / 0	8
	665	P1686B Odd Subarrays dp greedy *800	0 / 0	3
	653	P1689C Infected Tree dfs and similar dp trees *1600	0 / 0	5
	652	P1689D Lena and Matrix data structures dp geometry shortest paths *1900	0 / 0	6
	638	P1691F K-Set Tree combinatorics dfs and similar dp math trees *2500	0 / 0	9
	631	P1692G 2^Sort data structures dp sortings two pointers *1400	0 / 0	4
	630	P1692H Gambling data structures dp greedy math *1700	0 / 0	5
	628	P1693B Fake Plastic Trees dfs and similar dp greedy trees *1700	0 / 0	5
	626	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	10
	619	P1695C Zero Path brute force data structures dp graphs greedy shortest paths *1700	0 / 0	5
	618	P1695D1 Tree Queries (Easy Version) brute force constructive algorithms dfs and similar dp greedy trees *2200	0 / 0	8
	617	P1695D2 Tree Queries (Hard Version) constructive algorithms dfs and similar dp greedy trees *2300	0 / 0	8
	608	P1696H Maximum Product? brute force combinatorics dp greedy implementation math two pointers *3500	0 / 0	10
	603	P1697E Coloring brute force combinatorics constructive algorithms dp geometry graphs greedy implementation math *2400	0 / 0	9
	591	P1699D Almost Triple Deletions data structures dp greedy *2300	0 / 0	8
	590	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	10
	586	P1700D River Locks binary search dp greedy math *1900	0 / 0	6
	584	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	10
	579	P1701E Text Editor brute force dp greedy strings *2500	0 / 0	9
	564	P1703F Yet Another Problem About Pairs Satisfying an Inequality binary search data structures dp greedy sortings *1300	0 / 0	4
	563	P1703G Good Key, Bad Key bitmasks brute force dp greedy math *1600	0 / 0	5
	558	P1704E Count Seconds brute force constructive algorithms dp graphs implementation math *2200	0 / 0	8
	557	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	10
	555	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	10
	546	P1706B Making Towers dp greedy math *1100	0 / 0	3
	545	P1706C Qpwoeirut And The City dp flows greedy implementation *1400	0 / 0	4
	543	P1706D2 Chopping Carrots (Hard Version) brute force constructive algorithms data structures dp greedy math number theory two pointers *2400	0 / 0	9
	538	P1707D Partial Virtual Trees combinatorics dfs and similar dp math trees *3000	0 / 0	10
	536	P1707F Bugaboo bitmasks constructive algorithms dp number theory *3500	0 / 0	10
	532	P1709B Also Try Minecraft data structures dp implementation *900	0 / 0	3
	528	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees *2500	0 / 0	9
	525	P1710C XOR Triangle bitmasks brute force constructive algorithms dp greedy math *2500	0 / 0	9
	511	P1713C Build Permutation constructive algorithms dp math *1200	0 / 0	4
	508	P1713F Lost Array bitmasks combinatorics constructive algorithms dp math *2900	0 / 0	10
	504	P1714D Color with Occurrences brute force data structures dp greedy strings *1600	0 / 0	5
	496	P1715E Long Way Home data structures divide and conquer dp geometry graphs greedy shortest paths *2400	0 / 0	9
	492	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	7
	491	P1716D Chip Move brute force dp math *2000	0 / 0	7
	490	P1716E Swap and Maximum Block bitmasks data structures dfs and similar divide and conquer dp *2500	0 / 0	9
	489	P1716F Bags with Balls combinatorics dp math number theory *2500	0 / 0	9
	482	P1718A1 Burenka and Traditions (easy version) dp greedy *1800	0 / 0	6
	481	P1718A2 Burenka and Traditions (hard version) data structures dp greedy *1900	0 / 0	6
	469	P1720D1 Xor-Subsequence (easy version) bitmasks brute force dp strings trees two pointers *1800	0 / 0	6
	468	P1720D2 Xor-Subsequence (hard version) bitmasks data structures dp strings trees *2400	0 / 0	9
	462	P1721E Prefix Function Queries dfs and similar dp hashing string suffix structures strings trees *2200	0 / 0	8
	456	P1722E Counting Rectangles brute force data structures dp implementation *1600	0 / 0	5
	449	P1725E Electrical Efficiency combinatorics data structures dp math number theory trees *2500	0 / 0	9
	444	P1725J Journey dp trees *2500	0 / 0	9
	441	P1725M Moving Both Hands dp graphs shortest paths *1800	0 / 0	6
	429	P1728D Letter Picking constructive algorithms dp games two pointers *1800	0 / 0	6
	426	P1728G Illumination binary search bitmasks brute force combinatorics dp math two pointers *2700	0 / 0	10
	419	P1729G Cut Substrings combinatorics dp hashing strings two pointers *2100	0 / 0	7
	413	P1730F Almost Sorted bitmasks data structures dp *2700	0 / 0	10
	409	P1731D Valiant's New Map binary search brute force data structures dp two pointers *1700	0 / 0	5
	408	P1731E Graph Cost dp greedy math number theory *2000	0 / 0	7
	407	P1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	9
	405	P1732B Ugu brute force dp greedy implementation *900	0 / 0	3
	400	P1732E Location data structures dp math number theory *2800	0 / 0	10
	395	P1733D2 Zero-One (Hard Version) dp greedy *2000	0 / 0	7
	394	P1733E Conveyor constructive algorithms dp math *2700	0 / 0	10
	390	P1734D Slime Escape data structures dp greedy two pointers *1800	0 / 0	6
	388	P1734F Zeros and Ones bitmasks divide and conquer dp math *2500	0 / 0	9
	378	P1736C2 Good Subarrays (Hard Version) binary search data structures dp two pointers *2400	0 / 0	9
	376	P1736E Swap and Take dp greedy *2600	0 / 0	10
	372	P1737D Ela and the Wiring Wizard brute force dp graphs greedy implementation shortest paths *2200	0 / 0	8
	371	P1737E Ela Goes Hiking combinatorics dp math probabilities *2500	0 / 0	9
	366	P1738C Even Number Addicts dp games greedy math *1500	0 / 0	5
	364	P1738E Balance Addicts combinatorics dp math two pointers *2300	0 / 0	8
	362	P1738G Anti-Increasing Addicts constructive algorithms dp greedy math *2900	0 / 0	10
	358	P1739C Card Game combinatorics constructive algorithms dp games *1500	0 / 0	5
	356	P1739E Cleaning Robot bitmasks dp *2400	0 / 0	9
	355	P1739F Keyboard Design bitmasks data structures dp string suffix structures strings *2600	0 / 0	10
	350	P1740E Hanging Hearts constructive algorithms data structures dfs and similar dp greedy trees *1800	0 / 0	6
	349	P1740F Conditional Mix combinatorics dp math *2600	0 / 0	10
	346	P1740I Arranging Crystal Balls data structures divide and conquer divide and conquer dp geometry graphs number theory *3500	0 / 0	10
	341	P1741E Sending a Sequence Over the Network dp *1600	0 / 0	5
	339	P1741G Kirill and Company bitmasks brute force dfs and similar dp flows graphs shortest paths *2200	0 / 0	8
	329	P1743C Save the Magazines constructive algorithms dp greedy *1100	0 / 0	3
	328	P1743D Problem with Random Tests brute force dp greedy probabilities *1700	0 / 0	5
	327	P1743E FTL binary search dp *2400	0 / 0	9
	326	P1743F Intersection and Union data structures dp matrices probabilities *2300	0 / 0	8
	325	P1743G Antifibonacci Cut bitmasks combinatorics constructive algorithms data structures dp hashing math *3000	0 / 0	10
	314	P1746D Paths on the Tree dfs and similar dp greedy sortings trees *1900	0 / 0	6
	312	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	10
	310	P1746G Olympiad Training binary search data structures dp flows geometry implementation sortings *3500	0 / 0	10
	305	P1747E List Generation combinatorics dp math *2900	0 / 0	10
	302	P1748C Zero-Sum Prefixes brute force data structures dp greedy implementation *1600	0 / 0	5
	300	P1748E Yet Another Array Counting Problem binary search data structures divide and conquer dp flows math trees *2300	0 / 0	8
	295	P1749D Counting Arrays combinatorics dp math number theory *1900	0 / 0	6
	288	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	287	P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	286	P1750G Doping combinatorics dp math *3300	0 / 0	10
	285	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	284	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	283	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	5

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