![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
区间DP
qq_37383726
这个作者很懒,什么都没留下…
展开
-
【Codeforces Round #427】 C 【打表+DP】
The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).O原创 2017-10-13 18:01:46 · 269 阅读 · 0 评论 -
【51Nod 1021 】石子归并 【区间DP】
N堆石子摆成一个环。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。 例如: 1 2 3 4,有不少合并方法 1 2 3 4 => 3 3 4(3) => 6 4(9) => 10(19) 1 2 3 4 => 1 5 4(5) => 1 9(14) => ...原创 2018-06-12 01:24:45 · 174 阅读 · 0 评论 -
[POJ-1651]Multiplication Puzzle [区间DP 入门]
The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the pr...原创 2018-10-05 16:35:26 · 157 阅读 · 0 评论