斜率优化题

[ZJOI 2007] 仓库建设
这里写链接内容

DP[i]=min(DP[j]+c(i,j)+cost[i])

DP[i]=min(DP[j]+(sum[i]−sum[j])∗x[i]−(sumxp[i]−sumxp[j])+cost[i])
这种的式子可以斜率优化

#include<cstdio>
using namespace std;
const int M=1100000; 
int q[M],head,tail,n;
long long dp[M],sum[M],sumx[M],c[M],p[M],x[M];
double k(int x,int y){
    return double(dp[y]-dp[x]+sumx[y]-sumx[x])/double(sum[y]-sum[x]);
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%lld%lld%lld",&x[i],&p[i],&c[i]),sum[i]=sum[i-1]+p[i],sumx[i]=sumx[i-1]+p[i]*x[i];
    for(int i=1;i<=n;i++){
        while(head<tail&&k(q[head],q[head+1])<x[i])head++;
        dp[i]=dp[q[head]]+x[i]*(sum[i]-sum[q[head]])-sumx[i]+sumx[q[head]]+c[i];
        while(head<tail&&k(q[tail-1],q[tail])>k(q[tail],i))tail--;
        q[++tail]=i;
    }
    printf("%lld",dp[n]);
} 

[APIO 2014] 序列分割

f[i][k]=f[j][k−1]+(sum[i]−sum[j])∗sum[j]
很明显的斜率优化

#include <cstdio>
#include <iostream>
#define ll long long
const int M=110000;
ll dp[M][2],sum[M],x[M],ans=0;
int dl[M],n,k; 
double slop(int j,int k,int w){
    return (double)(sum[k]*sum[k]-sum[j]*sum[j]+dp[j][w]-dp[k][w])/(double)(sum[k]-sum[j]);
}
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++){
         scanf("%d",&x[i]);
         sum[i]=sum[i-1]+x[i];
         if(sum[i]==sum[i-1]) i--,n--;
    }
    k=k<n?k:n-1;
    for(int i=1;i<=k;i++) {
        int v=i&1,t=v^1,l=0,r=0;
        for(int j=i;j<=n;j++){
            while(l<r&&slop(dl[l],dl[l+1],t)<sum[j]) l++;
            dp[j][v]=dp[dl[l]][t]+(sum[j]-sum[dl[l]])*sum[dl[l]];
            while(l<r&&slop(dl[r-1],dl[r],t)>slop(dl[r-1],j,t)) r--;
            dl[++r]=j;
        } 
    }

    for(int i=1;i<=n;i++) ans=std::max(ans,dp[i][k&1]);
    printf("%lld\n",ans);
    return 0;
}

[APIO 2010] 特别行动队
题目

f[i]=f[j]+a*(sum[i]-sum[j-1])^2+b*(sum[i]-sum[j-1])+c

#include<cstdio>
using namespace std;
const int M=1100000; 
int q[M],head,tail,n,a,b,c;
long long dp[M],sum[M],p[M],x[M];
double k(int x,int y){
    return double(dp[y]-dp[x]-b*sum[y]+b*sum[x]+a*sum[y]*sum[y]-a*sum[x]*sum[x])/double(sum[y]-sum[x]);
}
int main(){
    scanf("%d%d%d%d",&n,&a,&b,&c);
    for(int i=1;i<=n;i++) scanf("%lld",&sum[i]),sum[i]+=sum[i-1];
    for(int i=1;i<=n;i++){
        while(head<tail&&k(q[head],q[head+1])>2*a*sum[i])head++;
        dp[i]=dp[q[head]]+a*(sum[i]-sum[q[head]])*(sum[i]-sum[q[head]])+b*(sum[i]-sum[q[head]])+c;
        while(head<tail&&k(q[tail-1],q[tail])<k(q[tail],i))tail--;
        q[++tail]=i;
    }
    printf("%lld",dp[n]);
} 

bzoj3156: 防御准备
链接
首先DP[i][0]为安排好 i+1-n 且在 i 放置 木偶的 最小花费.
DP[i][1]为安排好 i+1-n 且在 i 放置 防御塔 的最小花费.
DP[i][0]=min(DP[j][1]+(j-i)*(j-i+1)/2)
DP[i][1]=min(DP[i+1][1],DP[i+1][0])+a[i]

#include <cstdio>
#include <iostream>
#define ll long long
const int maxm=1e6+100;
ll dp[maxm][2],a[maxm];
int dl[maxm];
int n;
double slop(int j,int k)
{
    return (double)(dp[j][1]-dp[k][1])/(j-k)+(double)(k+j+1)/2;  
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
     scanf("%lld",&a[i]);
    dp[n][1]=a[n],dp[n][0]=1e9;
    dl[1]=n;
    int l=1,r=1;
    for(int i=n-1;i>=1;i--)
    {
        while(l<r&&slop(dl[l],dl[l+1])>i) l++;
        int j=dl[l];
        dp[i][0]=dp[j][1]+1ll*(j-i)*(j-i+1)/2;
        dp[i][1]=std::min(dp[i+1][1],dp[i+1][0])+a[i];
        while(l<r&&slop(dl[r-1],dl[r])<slop(dl[r],i)) r--;
        dl[++r]=i;
    }
    printf("%lld\n",std::min(dp[1][0],dp[1][1]));
    return 0; 
}

[HDU 3507] Print Article

dp[i]=dp[q[l]]+(sum[i]-sum[q[l]])*(sum[i]-sum[q[l]])+1ll*K;

#include <cstdio>
#include <iostream>
#define ll long long
const int M=510000;
ll dp[M],sum[M];
int q[M],K,n;
double k(int x,int y){
    return (double)(dp[y]+sum[y]*sum[y]-dp[x]-sum[x]*sum[x])/(double)(2*(sum[y]-sum[x]));
}
int main()
{
    while(~(scanf("%d%d",&n,&K))){
        for(int i=1;i<=n;i++){
            scanf("%lld",&sum[i]);
            sum[i]+=sum[i-1];
            if(sum[i]==sum[i-1]) i--,n--;
        }
        for(int i=1,l=0,r=0;i<=n;i++){
            while(l<r&&k(q[l],q[l+1])<sum[i]) l++;
            dp[i]=dp[q[l]]+(sum[i]-sum[q[l]])*(sum[i]-sum[q[l]])+1ll*K;
            while(l<r&&k(q[r-1],q[r])>k(q[r-1],i)) r--;
            q[++r]=i;
        }
        printf("%lld\n",dp[n]);
    }
    return 0;
} 

[BZOJ 3437] 小P的牧场
lianjie

dp[i]=dp[j]+h[j+1]-h[i]-(sum[i-1]-sum[j])1ll(n-i)+cost[i];

#include <cstdio>
#include <iostream>
#define ll long long
const int maxm=1000010;
ll dp[maxm];
ll cost[maxm],p[maxm],sum[maxm],h[maxm];
int dl[maxm],n;
double slop(int k,int j){
    return (double)(dp[j]+h[j+1]-dp[k]-h[k+1])/(double)(sum[j]-sum[k]);
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
     scanf("%lld",&cost[i]);
    for(int i=1;i<=n;i++){
        scanf("%lld",&p[i]);
        sum[i]=p[i]+sum[i-1];
    }
    for(int i=n-1;i>=1;i--) h[i]+=h[i+1]+p[i]*1ll*(n-i);
    for(int i=1,l=1,r=1;i<=n;i++){
        while(l<r&&slop(dl[l],dl[l+1])<(i-n)) l++;
        int j=dl[l];
        dp[i]=dp[j]+h[j+1]-h[i]-(sum[i-1]-sum[j])*1ll*(n-i)+cost[i];
        while(l<r&&slop(dl[r-1],dl[r])>slop(dl[r],i)) r--;
        dl[++r]=i;
    }
    printf("%lld\n",dp[n]);
    return 0;
}