【HNOI2008】【BZOJ1010】玩具装箱（斜率优化DP）

Description

click me

Solution

$dp_i$表示以第 i <script type="math/tex" id="MathJax-Element-2">i</script>个玩具结尾的最小代价，转移非常显然。
斜率优化裸题。。

Code

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#define For(i , j , k) for (register int i = (j) , _##end_ = (k) ; i <= _##end_ ; ++ i)
#define Set(a , b) memset(a , b , sizeof(a))
typedef long long LL;
using namespace std;

const int maxn = 50010;
int n , q[maxn] , head , tail;
LL L , c , sum[maxn] , f[maxn] , dp[maxn];

inline void Init()
{
    scanf("%d%lld" , &n , &L);
    c = L + 1;
    For(i , 1 , n)
        scanf("%lld" , &sum[i]),
        sum[i] += sum[i - 1];
    For(i , 1 , n)
        f[i] = sum[i] + i;
}

inline LL y(int t)
{
    return dp[t] + 2 * c * f[t] + f[t] * f[t];
}

inline LL x(int t)
{
    return f[t] * 2;
}

inline LL Get_dp(int i , int j)
{
    return dp[j] + (f[i] - f[j] - c) * (f[i] - f[j] - c);
}

inline bool check_k(LL x1 , LL y1 , LL x2 , LL y2 , LL x3 , LL y3)
{
    return (y2 - y1) * (x3 - x2) <= (y3 - y2) * (x2 - x1);
}

inline bool check_mon(LL f , LL x1 , LL y1 , LL x2 , LL y2)
{
    return f * (x2 - x1) >= (y2 - y1);
}

inline void DP()
{
    head = tail = 1;
    q[1] = 0;
    For(i , 1 , n)
    {
        while (head < tail && check_mon(f[i] , x(q[head]) , y(q[head]) , x(q[head + 1]) , y(q[head + 1])))
            ++ head;
        dp[i] = Get_dp(i , q[head]);
        q[++ tail] = i;
        while (head + 1 < tail && !check_k(x(q[tail - 2]) , y(q[tail - 2]) , x(q[tail - 1]) , y(q[tail - 1]) , x(q[tail]) , y(q[tail])))
        {
            -- tail;
            q[tail] = q[tail + 1];
        }
    }
    printf("%lld\n" , dp[n]);
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("HNOI2008toy.in" , "r" , stdin);
    freopen("HNOI2008toy.out" , "w" , stdout);
#endif
    Init();
    DP();
    return 0;
}
//千金纵买相如赋，脉脉此情谁诉。
//    -- 辛弃疾《摸鱼儿·更能消几番风雨》