dp - Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
6414	P258D Little Elephant and Broken Sorting dp math probabilities *2600	0 / 0	(None)
6404	P261B Maxim and Restaurant dp math probabilities *1900	0 / 0	(None)
6403	P261C Maxim and Matrix constructive algorithms dp math *2000	0 / 0	(None)
6402	P261D Maxim and Increasing Subsequence dp *2600	0 / 0	(None)
6401	P261E Maxim and Calculator brute force dp two pointers *2800	0 / 0	(None)
6394	P263E Rhombus brute force data structures dp *2500	0 / 0	(None)
6392	P264B Good Sequences dp number theory *1500	0 / 0	(None)
6391	P264C Choosing Balls dp *2000	0 / 0	(None)
6390	P264D Colorful Stones dp two pointers *2500	0 / 0	(None)
6389	P264E Roadside Trees data structures dp *3000	0 / 0	(None)
6375	P268D Wall Bars dp *2300	0 / 0	(None)
6372	P269B Greenhouse Effect dp *1700	0 / 0	(None)
6370	P269D Maximum Waterfall data structures dp graphs sortings *2600	0 / 0	(None)
6356	P273D Dima and Figure dp *2400	0 / 0	(None)
6355	P273E Dima and Game dp games *2600	0 / 0	(None)
6353	P274B Zero Tree dfs and similar dp greedy trees *1800	0 / 0	(None)
6344	P276D Little Girl and Maximum XOR bitmasks dp greedy implementation math *1700	0 / 0	(None)
6339	P277D Google Code Jam dp probabilities *2800	0 / 0	(None)
6333	P279C Ladder dp implementation two pointers *1700	0 / 0	(None)
6332	P279D The Minimum Number of Variables bitmasks dp *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories