CCNU校赛2017 - F 康康撩妹(斜率DP)

分析：大概就是f[i][j] = min (f[k][j-1] + w[k+1][i])这种形式的DP,我们把w函数拆开可以得到一个斜率为-dis[i][n]的等式,随着i的增大斜率也在不断增大,所以我们维护一个下凸的决策队列,这样能把转移复杂度优化到O (1).

题目链接：https://acm.whu.edu.cn:8443/problem/663

#include <bits/stdc++.h>
#define INF 10000000000000000ll
#define N 50004
#define xa (q[tail-3]+1)
#define xb (q[tail-2]+1)
#define xc (q[tail-1]+1)
#define ya (f[q[tail-3]][j-1] + pre[q[tail-3]+1])
#define yb (f[q[tail-2]][j-1] + pre[q[tail-2]+1])
#define yc (f[q[tail-1]][j-1] + pre[q[tail-1]+1])
using namespace std;
typedef long long ll;
int T,n,m,a[N],q[N];
ll pre[N],f[N][105];
ll cost(int l,int r)
{
    return pre[l] - pre[r+1] - 1ll*(r-l+1)*(a[n]-a[r]);
}
ll val(int k,int j,int i)
{
    return f[k][j-1] + cost(k+1,i);
}
int main()
{
    scanf("%d",&T);
    for(int Case = 1;Case <= T;Case++)
    {
        scanf("%d%d",&n,&m);
        for(int i = 1;i <= n;i++) scanf("%d",&a[i]);
        sort(a+1,a+1+n);
        pre[n+1] = 0;
        for(int i = n;i;i--) pre[i] = pre[i+1] + a[n] - a[i];
        for(int i = 1;i <= m;i++) f[0][i] = INF;
        for(int i = 1;i <= n;i++) f[i][1] = cost(1,i);
        for(int j = 2;j <= m;j++)
        {
            int head = 0,tail = 0;
            q[tail++] = 0;
            for(int i = 1;i <= n;i++)
            {
                while(tail - head > 1 && val(q[head],j,i) >= val(q[head+1],j,i)) head++;
                f[i][j] = min(INF,val(q[head],j,i));
                q[tail++] = i;
                while(tail - head > 2 && (ya-yc)*(xa-xb) <= (ya-yb)*(xa-xc))
                {
                    q[tail-2] = q[tail-1];
                    tail--;
                }
            }
        }
        cout<<"CASE #"<<Case<<": "<<f[n][m]<<endl;
    }
}