HDU - 2829（斜率优化DP）

题解：用f[i]表示a[1]^2+a[2]^2+...a[i]^2,sum[i] = a[1]+a[2]+...a[i];dp[i][j] = min(dp[i][j],dp[i-1][a]+((sum[j]-sum[a])*(sum[j]-sum[a])-f[j]+f[a])/2));

然后一个一个试的话是1e9会超时可以用斜率换算一下就是(2*dp[j][b]-2*dp[j][a]+sum[b]*sum[b]-sum[a]*sum[a]+f[b]-f[a])/(sum[b]-sum[a])<2*sum[i]然后就是斜率优化问题了

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int mx = 1e3+5;
int dp[mx][mx];
int sum[mx];
int a[mx];
int f[mx];
deque<int>q;
int n,m;
int get(int j,int a,int b){
    return 2*dp[j][b]-2*dp[j][a]+sum[b]*sum[b]-sum[a]*sum[a]+f[b]-f[a];
}
void erase_front(int j,int i){
    while(q.size()>=2){
        int a = q.front();
        q.pop_front();
       int b = q.front();
        if(get(j,a,b)>2*sum[i]*(sum[b]-sum[a])){
            q.push_front(a);
            return;
        }
    }
}
void insert(int j,int i){
    while(q.size()>=2){
        int a = q.back();
        q.pop_back();
        int b = q.back();
        if(get(j,b,a)*(sum[i]-sum[b])<get(j,b,i)*(sum[a]-sum[b])){
            q.push_back(a);
            break;
        }
    }
    q.push_back(i);
}
void solve(){
    for(int i = 0; i <= m; i++){
        q.push_back(i);
        for(int j = i+1; j <= n; j++)
            if(i==0)
                dp[i][j] = (sum[j]*sum[j]-f[j])/2;
            else{
                erase_front(i-1,j);
                int a = q.front();
                dp[i][j] = dp[i-1][a]+((sum[j]-sum[a])*(sum[j]-sum[a])-f[j]+f[a])/2;
                insert(i-1,j);
            }
        while(!q.empty())
            q.pop_back();
    }
    printf("%d\n",dp[m][n]);
}
int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        if(n == 0 && m == 0)
                break;
        for(int i = 1; i <= n; i++)
            scanf("%d",&a[i]);
        memset(dp,0,sizeof(dp));
        memset(f,0,sizeof(f));
        for(int i = 1; i <= n; i++){
            sum[i] = sum[i-1]+a[i];
            f[i] = f[i-1]+a[i]*a[i];
        }
        solve();
    }
    return 0;
}