HDU-3507-打印文章

HDU-3507-打印文章

$[Task]$:

Zero has an old printer that doesn’t work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for a long time and it will certainly wear and tear, so Zero use a cost to evaluate this degree.
One day Zero want to print an article which has N words, and each word i has a cost Ci to be printed. Also, Zero know that print k words in one line will cost

M is a const number.
Now Zero want to know the minimum cost in order to arrange the article perfectly.

$[Solution]$:

这道题很容易知道是斜率优化的dp

首先推一遍斜率:

先考虑两个状态 dp[i],dp[j] ( i < <script type="math/tex" id="MathJax-Element-3"><</script>j )
设 dp[k] 为当前状态
所以
dp[k]=min( (sum[k]-sum[i])$^2$+m+dp[i],(sum[k]-sum[j])$^2$+m+dp[j] );(这就是转移的方程)
设选择 i;

所以:
(sum[k]-sum[i]) 2