我犯了sb错误然后调了1个小时......队列写错了
斜率k递增,b取最小值,队列维护凸包即可
f[0]的预处理好像有些奇怪???我把inf调大就过了???
#include <cstdio>
#include <algorithm>
#include <cstring>
#define il inline
#define ll long long
#define N 3010
#define inf 66666666
using namespace std;
//re
int n,que[N];
ll m,L,f[N][N],a[N],s[N];
int gc()
{
int rett=0,fh=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')fh=-1;c=getchar();}
while(c>='0'&&c<='9'){rett=(rett<<3)+(rett<<1)+c-'0';c=getchar();}
return rett*fh;
}
il ll yy(int i,int k){return f[i][k]+m*m*s[k]*s[k]+2ll*m*L*s[k]+L*L;}
il ll kk(int j){return 2ll*m*m*s[j];}
int main()
{
freopen("a.in","r",stdin);
n=gc(),m=gc();
for(int i=1;i<=n;i++) a[i]=gc(),s[i]=s[i-1]+a[i],L+=a[i];
int hd,tl;
for(int i=1;i<=n;i++) f[0][i]=inf;
for(int i=1;i<=m;i++)
{
hd=tl=1,que[1]=0;
for(int j=0;j<=n;j++)
{
while(hd+1<=tl&&(yy(i-1,que[hd+1])-kk(j)*s[que[hd+1]])<=(yy(i-1,que[hd])-kk(j)*s[que[hd]]))
hd++;
f[i][j]=yy(i-1,que[hd])-kk(j)*s[que[hd]]-2ll*m*L*s[j]+m*m*s[j]*s[j];
while(hd+1<=tl&&(yy(i-1,j+1)-yy(i-1,que[tl]))*(s[que[tl]]-s[que[tl-1]])<=(yy(i-1,que[tl])-yy(i-1,que[tl-1]))*(s[j+1]-s[que[tl]]))
tl--;
que[++tl]=j+1;
}
}
printf("%lld\n",f[m][n]/m);
return 0;
}