P3723 [AH2017/HNOI2017]礼物 快速傅里叶变换fft 推公式

题意

可以将$x_i$加上任意数字$c$，并任意旋转一手环，使得${\sum }_{i=1}^n(x_i-y_i{)}^2$最小

分析

先不考虑旋转：
${\sum }_{i=1}^n(x_i-y_i{)}^2$

${\sum }_{i=1}^n(x_i+c-y_i{)}^2$最小

$={\sum }_{i=1}^n(x_i^2+y_i^2+2c(x_i-y_i)-2x_i{y}_i+c^2)$

$={\sum }_{i=1}^n{x}_i^2+{\sum }_{i=1}^n{y}_i^2+2c{\sum }_{i=1}^n{x}_i-2c{\sum }_{i=1}^n{y}_i-2{\sum }_{i=1}^n{x}_i{y}_i+n{c}^2$

观察柿子可以发现，出${\sum }_{i=1}^n{x}_i{y}_i$外，均为定值（关于$c$的柿子是一个二次函数，存在极值），为了使用$fft$解决上述问题，将柿子进行化简，${\sum }_{i=1}^n{x}_i{y}_i={\sum }_{i=1}^n{x}_{n-i+1}{y}_i$，上述可以用$fft$快速求解。

由于全局最小值，相当于求上述${\sum }_{i=1}^n{x}_{n-i+1}{y}_i$最大值，$x_i，y_i$相当于多项式$A,B$第$i$项的系数，${\sum }_{i=1}^n{x}_{n-i+1}{y}_i$就是$n+1$项的系数。

旋转可以看做平移，将$A$平移为两倍，答案就是$min[n+1\sim 2n]$项的系数

代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll; 

const int N = 1e6+10, M = N * 2, inf = 1e8;
const double PI = acos(-1);
int n, m;
int rev[N], bit, tot;
struct Complex{
    double x, y;
    Complex operator+ (const Complex& t) const { return {x + t.x, y + t.y}; }
    Complex operator- (const Complex& t) const{ return {x - t.x, y - t.y}; }
    Complex operator* (const Complex& t) const{ return {x * t.x - y * t.y, x * t.y + y * t.x}; }
}a[N], b[N];

void fft(Complex a[], int inv){
    for(int i = 0; i < tot; i++)
        if(i < rev[i]) swap(a[i], a[rev[i]]);
    for(int mid = 1; mid < tot; mid <<= 1){
        Complex w1 = Complex({cos(PI/mid), inv * sin(PI/mid)});
        for(int i = 0; i < tot; i += mid * 2){
            Complex wk = Complex({1, 0});
            for(int j = 0; j < mid; j ++, wk = wk * w1){
                Complex x = a[i + j], y = wk * a[i + j + mid];
                a[i + j] = x + y, a[i + j + mid] = x - y;
            }
        }
    }
}
double A[N], B[N];
ll a2, b2, suma, sumb;
int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n>>m;

    while((1 << bit) < 3 * n + 1) bit++;
    tot = 1 << bit;
    for(int i = 0; i < tot; i++) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (bit - 1));

    for(int i = 1; i <= n; i++) cin>>A[i], suma += A[i], a2 += A[i] * A[i];
    for(int i = 1; i <= n; i++) cin>>B[i], sumb += B[i], b2 += B[i] * B[i];

    for(int i = 1; i <= n; i++) a[i] = a[i+n] = {A[i], 0}, b[i] = {B[i], };
    reverse(b + 1, b + n + 1);

    fft(a, 1), fft(b, 1);
    for(int i = 0; i <= tot; i++) a[i] = a[i] * b[i];
    fft(a, -1);
    for(int i = 0; i <= tot; i++) a[i].x = (int)(a[i].x/tot+0.5);
    int ans = 1e9;
    for(int i = 1; i <= n; i++){
        for(int x = -m; x <= m; x++){
            int tmp = a2 + b2 + n * x * x;
            tmp += 2 * x * (suma - sumb);
            ans = min(ans, tmp - 2 * (int) a[i+n].x);
        }
    }
    cout<<ans<<endl;
    return 0;
}