玩具装箱toy

题目

---

定义状态dp[i]表示装好前i个玩具的最小代价。
dp[i] = min(dp[j] + (i-j-1+sum[i]-sum[j]-L)^2)
dp[i] = min(dp[j] + (i-1+sum[i]-L)^2 + (-j-sum[j])^2 + 2(i-1+sum[i]-L) (-j-sum[j]) )
dp[i] = min(dp[j] + (-j-sum[j])^2 + 2(i-1+sum[i]-L) (-j-sum[j]) ) + (i-1+sum[i]-L)^2
用斜率优化。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define N 500010
#define LL long long 
LL  sum[N], dp[N], c[N];
int q[N];
int l, r, n, D;
LL gx( int i ){
    return sum[i] + i;
}
LL gy( int i ){
    return dp[i] + (sum[i]+i)*(sum[i]+i);
}
int main(){
    scanf( "%d%d", &n, &D);
    for ( int i = 1; i <= n; i++) scanf( "%lld", &c[i]);
    for ( int i = 1; i <= n; i++) sum[i] = sum[i-1] + c[i];
    l=0,r=0;q[r] = 0;
    for ( int i = 1; i <= n; i++){
        LL k = 2*(sum[i]+i-1-D);
        for (;l<r && gy(q[l]) - k * gx(q[l]) >= gy(q[l+1]) - k * gx(q[l+1]);++l);
        dp[i] = gy(q[l]) - k*gx(q[l]) + k*k / 4;
        for (;l<r && (gy(i)-gy(q[r-1]))*(gx(i)-gx(q[r]))>=(gy(i)-gy(q[r]))*(gx(i)-gx(q[r-1]));r--);
        q[++r]=i;       
    }       
    printf( "%lld\n", dp[n]);
    return 0;
}