HDU 3480 Division

Division

HDU 3480

斜率优化dp，推出式子就解了

1.代价是(Max{T}-Min{T})^2,要使权值和最小，应该从小到大排序，然后按顺序取。

2.排完序后可以DP了。定义dp[i][j]:前i个数分成不超过j段的最小代价。

dp状态转移式
dp[i][j]=min{dp[i][j-1],dp[k][j-1]+(A[i]-A[k+1])^2}

3.斜率优化式

dp[k][j-1]+A[k+1]^2=dp[i][j]-A[i]^2+2*A[i]*A[k+1]

y=dp[k][j-1]+A[k+1]^2
k=2*A[i]
x=A[k+1]
求最小截距，维护下凸

具体代码如下：记得滚动数组

#include<bits/stdc++.h>
using namespace std;
const int M=1e4+5;
int n,m,A[M],q[M],l,r;
long long dp[2][M],g[M];
long long sqr(long long x) {
    return x*x;
}
int main() {
    int T;
    scanf("%d",&T);
    for(int cas=1; cas<=T; cas++) {
        scanf("%d %d",&n,&m);
        for(int i=1; i<=n; i++)scanf("%d",&A[i]);
        sort(A+1,A+1+n);
        int cur=0;
        memset(dp[0],63,sizeof(dp[0]));
        dp[0][0]=0;
        for(int t=1; t<=m; t++) {
            q[l=r=1]=0;
            cur=1-cur;
            for(int i=1; i<=n; i++) {
                while(l<r&&g[q[l+1]]-g[q[l]]<=2ll*A[i]*(A[q[l+1]+1]-A[q[l]+1]))l++;
                dp[cur][i]=dp[1-cur][q[l]]+sqr(A[i]-A[q[l]+1]);
                if(dp[1-cur][i]<1e18) {
                    g[i]=dp[1-cur][i]+sqr(A[i+1]);
                    while(l<r&&(g[q[r]]-g[q[r-1]])*(A[i+1]-A[q[r]+1])>=(g[i]-g[q[r]])*(A[q[r]+1]-A[q[r-1]+1]))r--;
                    q[++r]=i;
                }
                //printf("dp[%d][%d]=%lld\n",t,i,dp[cur][i]);
            }
        }
        printf("Case %d: %lld\n",cas,dp[cur][n]);
    }
    return 0;
}