题目传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=4827
前言:还记得第一次看见这题是今年4月24号,省赛前集训的时候。那个时候我连卷积都没听说过,听到正解是FFT一脸懵逼。直到上个周末,我%了一波menci大神的blog和算导,正式入了FFT的坑,才发现这是道FFT裸题QAQ。于是在刷完hdu4609,知道了 a+b>c,a+c>b,b+c>a 这三条不等式顶多只有一条不成立之后,我果断跑过来切了这题。
题目分析:我们把题目给的原式拆开,就会推导出以下式子:
假设令所有x同时加上c,则对答案的额外贡献为:
从-2m~2m暴力枚举,求出令下面那条式子最小的c即可。
然后观察回第一条式子,发现最大化 ∑ni=1xiyi 这项比较难办。由于x与y的下标之差相等,我们将y数组翻转,就变成了x与y的下标之和相等,这就变成了多项式乘法。由于是求循环最小值,还要将x数组复制一遍。FFT完之后,求出第n-1项~第2n-1项的最大系数即可。时间复杂度 O(nlog(n)+m)
在学写FFT的时候,我发现了一句神奇的代码:Complex (double a=0.0,double b=0.0) : X(a),Y(b) {}。把这个写进结构体里,就可以将Complex(x,y)当成一个结构体直接传出,赋值。还可以用e(x,y)声明复数e并对其直接赋值。
这题我debug了很久,各种地方写错,比如pi=acos(1.0)数学没学好,p写成了a等等。果然还是不够熟练啊QAQ。
CODE:
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxn=300000;
const double pi=acos(-1.0);
struct Complex
{
double X,Y;
Complex (double a=0.0,double b=0.0) : X(a),Y(b) {}
} ;
Complex operator+(Complex a,Complex b) { return Complex(a.X+b.X,a.Y+b.Y); }
Complex operator-(Complex a,Complex b) { return Complex(a.X-b.X,a.Y-b.Y); }
Complex operator*(Complex a,Complex b) { return Complex(a.X*b.X-a.Y*b.Y,a.X*b.Y+a.Y*b.X); }
int Rev[maxn];
Complex A[maxn];
Complex B[maxn];
int sumX=0,sumY=0;
int n,m;
int N,Lg;
void DFT(Complex *a,double f)
{
for (int i=0; i<N; i++)
if (i<Rev[i]) swap(a[i],a[ Rev[i] ]);
for (int len=2; len<=N; len<<=1)
{
int mid=len>>1;
Complex e( cos( 2.0*pi/((double)len) ) , f*sin( 2.0*pi/((double)len) ) );
for (Complex *p=a; p!=a+N; p+=len)
{
Complex wn(1.0,0.0);
for (int i=0; i<mid; i++)
{
Complex temp=wn*p[mid+i]; //p不要打成a!!!
p[mid+i]=p[i]-temp;
p[i]=p[i]+temp;
wn=wn*e;
}
}
}
}
void FFT()
{
for (int i=0; i<N; i++)
for (int j=0; j<Lg; j++)
if ( i&(1<<j) ) Rev[i]|=( 1<<(Lg-j-1) );
DFT(A,1.0);
DFT(B,1.0);
for (int i=0; i<N; i++) A[i]=A[i]*B[i];
DFT(A,-1.0);
for (int i=0; i<N; i++) A[i].X/=((double)N);
}
void Reverse(Complex *a,int len)
{
for (int i=0; len-i-1>i; i++) swap(a[i],a[len-i-1]);
}
int main()
{
freopen("4827.in","r",stdin);
freopen("4827.out","w",stdout);
scanf("%d%d",&n,&m);
for (int i=0; i<n; i++)
{
int v;
scanf("%d",&v);
sumX+=v;
A[i]=Complex((double)v,0.0);
}
for (int i=0; i<n; i++)
{
int v;
scanf("%d",&v);
sumY+=v;
B[i]=Complex((double)v,0.0);
}
sumX-=sumY;
int c,val=1e9;
for (int i=-2*m; i<=2*m; i++)
{
int now=n*i*i+2*i*sumX;
if (now<val) val=now,c=i;
}
for (int i=0; i<n; i++) A[i].X+=((double)c);
sumX=0;
for (int i=0; i<n; i++) sumX+=( (int)(A[i].X*A[i].X+0.5) );
for (int i=0; i<n; i++) sumX+=( (int)(B[i].X*B[i].X+0.5) );
for (int i=n; i<2*n; i++) A[i]=A[i-n];
N=1;
Lg=0;
while (N<3*n) N<<=1,Lg++;
for (int i=2*n; i<N; i++) A[i]=Complex(0.0,0.0);
for (int i=n; i<N; i++) B[i]=Complex(0.0,0.0);
Reverse(B,n);
FFT();
int ans=-1e9;
for (int i=n-1; i<2*n; i++) ans=max(ans, (int)floor( A[i].X+0.5 ) );
ans=sumX-2*ans;
printf("%d\n",ans);
return 0;
}