dp - Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
7595	P2B The least round way dp math *2000	0 / 0	(None)
7586	P4D Mysterious Present dp sortings *1700	0 / 0	(None)
7583	P5C Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900	0 / 0	(None)
7577	P6D Lizards and Basements 2 brute force dp *2600	0 / 0	(None)
7571	P7E Defining Macros dp expression parsing implementation *2600	0 / 0	(None)
7568	P8C Looking for Order bitmasks dp *2000	0 / 0	(None)
7566	P8E Beads dp graphs *2600	0 / 0	(None)
7562	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	(None)
7559	P10B Cinema Cashier dp implementation *1500	0 / 0	(None)
7557	P10D LCIS dp *2800	0 / 0	(None)
7552	P11D A Simple Task bitmasks dp graphs *2200	0 / 0	(None)
7551	P11E Forward, march! binary search dp greedy *2800	0 / 0	(None)
7543	P13C Sequence dp sortings *2200	0 / 0	(None)
7542	P13D Triangles dp geometry *2600	0 / 0	(None)
7537	P14D Two Paths dfs and similar dp graphs shortest paths trees two pointers *1900	0 / 0	(None)
7536	P14E Camels dp *1900	0 / 0	(None)
7531	P15E Triangles combinatorics dp *2600	0 / 0	(None)
7526	P16E Fish bitmasks dp probabilities *1900	0 / 0	(None)
7523	P17C Balance dp *2500	0 / 0	(None)
7517	P18D Seller Bob brute force dp greedy *2000	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories