dp - Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
1856	P2B The least round way dp math *2000	0 / 0	(None)
1861	P4D Mysterious Present dp sortings *1700	1 / 1	10
1863	P5C Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900	0 / 0	(None)
1866	P6D Lizards and Basements 2 brute force dp *2600	0 / 0	(None)
1873	P8E Beads dp graphs *2600	0 / 0	(None)
1875	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	(None)
1877	P10B Cinema Cashier dp implementation *1500	0 / 0	(None)
1878	P10D LCIS dp *2800	0 / 0	(None)
1882	P11E Forward, march! binary search dp greedy *2800	0 / 0	(None)
1887	P13C Sequence dp sortings *2200	0 / 0	(None)
1888	P13D Triangles dp geometry *2600	0 / 0	(None)
1891	P14D Two Paths dfs and similar dp graphs shortest paths trees two pointers *1900	0 / 0	(None)
1892	P14E Camels dp *1900	0 / 0	(None)
1895	P15E Triangles combinatorics dp *2600	0 / 0	(None)
1898	P16E Fish bitmasks dp probabilities *1900	0 / 0	(None)
1900	P17C Balance dp *2500	0 / 0	(None)
1903	P18D Seller Bob brute force dp greedy *2000	0 / 0	(None)
1905	P19B Checkout Assistant dp *1900	0 / 0	(None)
1911	P21C Stripe 2 binary search dp sortings *2000	0 / 0	(None)
1913	P22B Bargaining Table brute force dp *1500	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories