dp - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	1381	P1381B Unmerge dp *1800	0 / 0	(None)
	1379	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(None)
	1376	P1382B Sequential Nim dp games *1100	0 / 0	(None)
	1374	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(None)
	1373	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
	1371	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(None)
	1368	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(None)
	1367	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(None)
	1363	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(None)
	1356	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(None)
	1355	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(None)
	1353	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	(None)
	1346	P1389B Array Walk brute force dp greedy *1600	0 / 0	(None)
	1345	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(None)
	1342	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(None)
	1341	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(None)
	1338	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(None)
	1337	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(None)
	1332	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(None)
	1329	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(None)

Pick a problem randomly based on the current filter.