HNOI2017 礼物

题目链接：https://www.luogu.com.cn/problem/P3723

我们要求的是一个和式，我们设$s={\sum }_{i=1}^n(x_i-y_i+c{)}^2$，$c$为负就是第二个手环加上$c$
展开可得：$$s=\sum _{i=1}^n{x}_i^2+y_i^2+c^2+(x_i-y_i)c-2x_i{y}_i$$

此时我们发现$x_i^2+y_i^2$为定值，中间带$c$的两项也可以通过二次函数求最小值，都与旋转无关

那我们已经可以求出$c$的值，现在只剩如何旋转使得${\sum }_{i=1}^{n}2x_i{y}_i$最大了

这个首先拉环成链，然后把拉成链的那个序列整个翻转一下，就可以得到卷积形式，$FFT$即可

不放将$y$拉环成链，旋转$k$格，则：
原式$={\sum }_{i=1}^n{x}_i{y}_{i+k}$
翻转后:${\sum }_{i=1}^n{x}_i{y}_{n+n-i-k+1}$
令$m=n+n-k+1$,则原式又可化为${\sum }_{i=1}^n{x}_i{y}_{m-i}$

这道题比较重要的就是${\sum }_{i=1}^n{x}_i{y}_i$把某个序列拉成链后再翻转该序列可以得到卷积形式

$Code$

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int MAXN = 200000;
const double Pi = acos(-1);
int a[MAXN + 10], b[MAXN + 10];

struct CP{
    double x, y;
    inline CP(double xx = 0, double yy = 0){x = xx, y = yy;}
};
inline CP operator + (const CP &x, const CP &y){return CP(x.x + y.x, x.y + y.y);}
inline CP operator * (const CP &x, const CP &y){return CP(x.x * y.x - x.y * y.y, x.y * y.x + x.x * y.y);}
inline CP operator - (const CP &x, const CP &y){return CP(x.x - y.x, x.y - y.y);}

namespace fft{
    int tree[MAXN * 2 + 10];
    void FFT(CP *f, int *tree, int n, int op){
        for (register int i = 0; i < n; ++i)
            if (i > tree[i])  swap(f[i], f[tree[i]]);

        for (register int p = 2; p <= n; p <<= 1){
            int len = p >> 1;
            CP rt(cos(2 * Pi / (double)p), sin(2 * Pi / (double)p));
            if (op) rt.y = -rt.y;
            for (register int k = 0; k < n; k += p){
                CP buf(1, 0);
                for (register int l = k; l < k + len; ++l){
                    CP tmp = buf * f[l + len];
                    f[l + len] = f[l] - tmp;
                    f[l] = f[l] + tmp;
                    buf = buf * rt;
                }
            }
        }
        if (op){
            for (register int i = 1; i <= n; ++i)
                f[i].x = f[i].x / (double)n;
        }
    }

    int MUL(int *a, int *b, int n, int m){
        static CP f[MAXN * 2 + 10], g[MAXN * 2 + 10];
        for (register int i = 0; i <= n; ++i)   f[i].x = a[i];
        for (register int i = 0; i <= m; ++i)   g[i].x = b[i];
        m += n, n = 1;
        while (n <= m)  n <<= 1;
        for (register int i = 0; i < n; ++i)   tree[i] = (tree[i >> 1] >> 1) | ((i & 1)? n >> 1 : 0);
        FFT(f, tree, n, 0), FFT(g, tree, n, 0);
        for (register int i = 0; i <= n; ++i)   f[i] = f[i] * g[i];
        FFT(f, tree, n, 1);
        for (register int i = 0; i <= m; ++i)   a[i] = (int)(f[i].x + 0.5);
        for (register int i = 0; i <= n; ++i){
            f[i].x = f[i].y = 0;
            g[i].x = g[i].y = 0;
        }
        return m;
    }
}

inline int read();

int main(){
	freopen ("std.in","r",stdin);
	freopen ("std.out","w",stdout);
    int n, m, c;
    n = read(), m = read();
    double sum = 0;
    for (register int i = 1; i <= n; ++i)   a[i] = read();
    for (register int i = 1; i <= n; ++i)   b[i] = read(), sum += b[i] - a[i];
    sum /= n;
    c = (int)(sum + 0.5);
    if (c > 0){
        for (register int i = 1; i <= n; ++i)
            a[i] += c;
    }
    else
    {
        for (register int i = 1; i <= n; ++i)
            b[i] += c;
    }
    long long ans = 0, tmp = 0;
    for (register int i = 1; i <= n; ++i)   ans += a[i] * a[i] + b[i] * b[i], b[i + n] = b[i];
    reverse(b + 1, b + n + n + 1);
    m = fft::MUL(a, b, n, n + n);
    for (register int i = n + 1; i <= m; ++i)
        tmp = max(tmp, (long long)a[i]);
    cout << ans - 2 * tmp << endl;
    return 0;
}

inline int read(){
    int x = 0;
    char c = getchar();
    while (!isdigit(c))c = getchar();
    while (isdigit(c))x = (x << 1) + (x << 3) + (c & 15), c = getchar();
    return x;
}