P3723 礼物
题目描述
题解
已知原数列
a
n
,
b
n
a_n,b_n
an,bn,于是可将问题转化为
求下方式子的最小值
∑
i
=
1
n
(
a
i
+
c
−
b
i
)
2
\sum\limits_{i=1}^n(a_i+c-b_i)^2
i=1∑n(ai+c−bi)2
将下列式子展开
=
∑
a
i
2
+
∑
b
i
2
+
n
c
2
+
2
c
∑
a
i
−
2
c
∑
b
i
−
2
∑
a
i
b
i
=\sum a_i^2+\sum b_i^2+nc^2+2c\sum a_i-2c\sum b_i-2\sum a_ib_i
=∑ai2+∑bi2+nc2+2c∑ai−2c∑bi−2∑aibi
显然除了最后一项,其他项都是已知的,于是问题转化为求下方式子的最大值
2
∑
a
i
b
i
2\sum a_ib_i
2∑aibi
考虑翻转,令
a
i
′
=
a
n
−
i
a'_i=a_{n-i}
ai′=an−i,于是转化成卷积的形式
2
∑
a
n
−
i
′
b
i
2\sum a'_{n-i}b_i
2∑an−i′bi
考虑将
a
n
′
a'_n
an′倍长,然后做FFT,得到的项里面的第
n
+
1
n+1
n+1到
2
n
2n
2n项的最大值,就是该式子的最大值。
最后答案记得再加上前面的不变项。
代码
#include <cmath>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
const int M=4e5+9;
const double pi=acos(-1.0);
int n,m,r[M],l,lim=1,a3[M],b3[M];
ll ans=1e17,a1,a2,b1,b2;
int read(){
int f=1,re=0;char ch;
for(ch=getchar();!isdigit(ch)&&ch!='-';ch=getchar());
if(ch=='-'){f=-1,ch=getchar();}
for(;isdigit(ch);ch=getchar()) re=(re<<3)+(re<<1)+ch-'0';
return re*f;
}
struct complex{
double x,y;
complex(double a=0,double b=0){x=a,y=b;}
friend inline complex operator+(complex a,complex b){return complex(a.x+b.x,a.y+b.y);}
friend inline complex operator-(complex a,complex b){return complex(a.x-b.x,a.y-b.y);}
friend inline complex operator*(complex a,complex b){return complex(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
}a[M],b[M];
void FFT(complex *A,int type){
for(int i=0;i<lim;i++) if(i<r[i]) swap(A[i],A[r[i]]);
for(int mid=1;mid<lim;mid<<=1){
complex W(cos(pi/mid),type*sin(pi/mid));
for(int R=mid<<1,j=0;j<lim;j+=R){
complex w(1,0);
for(int k=0;k<mid;k++,w=w*W){
complex x=A[j+k],y=w*A[j+k+mid];
A[j+k]=x+y;
A[j+mid+k]=x-y;
}
}
}
if(type==-1) for(int i=0;i<lim;i++) A[i].x=(ll)(A[i].x/lim+0.5);
}
signed main(){
n=read(),m=read();
for(int i=1;i<=n;i++){
a3[i]=read();
a1+=a3[i]*a3[i],a2+=a3[i];
}
for(int i=1;i<=n;i++){
b3[i]=read();
b1+=b3[i]*b3[i],b2+=b3[i];
}
for(int i=1;i<=n;i++){
a[i].x=a[i+n].x=a3[i];
b[n-i+1].x=b3[i];
}while(lim<=n*3) lim<<=1,l++;
for(int i=0;i<lim;i++) r[i]=(r[i>>1]>>1)|((i&1)<<(l-1));
FFT(a,1),FFT(b,1);
for(int i=0;i<lim;i++) a[i]=a[i]*b[i];
FFT(a,-1);
for(int i=1;i<=n;i++)
for(int j=-m;j<=m;j++)
ans=min(ans,a1+b1+j*j*n+2ll*j*(a2-b2)-2ll*(ll)a[i+n].x);
printf("%lld\n",ans);
return 0;
}