链接:点击打开链接
题意:给定一个长度为n的序列,将序列分成m段,每段序列都有权值,权值为序列内两个数两两相乘之和,输出最小的权值
代码:
#include <math.h>
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
int a[1005],q[1005];
long long w[1005],s[1005],dp[1005][1005];
long long getx(int x){
return w[x];
}
long long gety(int x,int y){
return dp[x][y]+(w[y]*w[y]+s[y])/2;
}
int cross(int x1,int y1,int x2,int y2,int x3,int y3){
return (y3-y1)*(x2-x1)-(y2-y1)*(x3-x1);
}
int main(){
int i,j,k,n,m,t,cas,head,tail;
while(scanf("%d%d",&n,&m)!=EOF&&(m||n)){
m++;
w[0]=s[0]=0; //dp[i][j]表示到j分成了i段的代价,这个题数据
for(i=1;i<=n;i++){ //范围为O(n*n*n)
scanf("%d",&a[i]); //而转移方程为dp[i][j]=min(dp[i-1][k]+((w[j]-w[k])^2-(s[j]-s[k]))/2)
w[i]=w[i-1]+a[i]; //恰好可以用斜率优化
s[i]=s[i-1]+a[i]*a[i]; //w[i]为前缀和,s[i]为前缀平方和
} //展开后 y=dp[i-1][k]+(w[k]^2+s[k])/2
memset(dp,0,sizeof(dp)); //k=w[j] x=w[k]
for(i=1;i<=n;i++)
dp[1][i]=((w[i]-w[0])*(w[i]-w[0])-(s[i]-s[0]))/2;
for(i=2;i<=m;i++){
head=tail=0;
for(j=1;j<=n;j++){
k=w[j];
while((head+1<tail)&&cross(getx(q[tail-2]),gety(i-1,q[tail-2]),getx(q[tail-1]),gety(i-1,q[tail-1]),getx(j),gety(i-1,j))<=0)
tail--;
q[tail++]=j; //维护一个凸包
while((head+1<tail)&&((gety(i-1,q[head+1])-gety(i-1,q[head]))<=k*(getx(q[head+1])-getx(q[head]))))
head++; //找出切点
dp[i][j]=gety(i-1,q[head])-k*getx(q[head]);
dp[i][j]+=(w[j]*w[j]-s[j])/2;
}
}
printf("%I64d\n",dp[m][n]);
}
return 0;
}