洛谷 P6300 悔改（FFT）

链接：洛谷 P6300 悔改

题意：

思路：
取min类型的卷积到普通乘法卷积的转化：
具体参考下面大佬的博客：洛谷 P6300 悔改题解

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
const double Pi = acos(-1.0);
int r[maxn];
int T, n , m , k ,d[maxn] , vis[maxn],ma = -1,ans1 = 0;
int ans[maxn] , cnt[maxn], temp,num[maxn],res[maxn];
struct Complex{
    double x, y;
    Complex(double xx = 0, double yy = 0) : x(xx), y(yy) {}
    Complex operator+(Complex b){
        return Complex(x + b.x, y + b.y);
    }
    Complex operator-(Complex b){
        return Complex(x - b.x, y - b.y);
    }
    Complex operator*(Complex b){
        return Complex(x * b.x - y * b.y, x * b.y + y * b.x);
    }
};

// 最高n，m次， 0次为常数
Complex a[maxn], b[maxn];
Complex c[maxn];
void fft(Complex *cm, int cnum, int tag){
    for(int i =  0 ; i <= cnum - 1; i ++){
        if (i < r[i]){
            swap(cm[i], cm[r[i]]);
        }
    }
    for (ll mid = 1; mid < cnum; mid <<= 1){
        Complex wk = Complex(cos(2 * Pi / (2 * mid)), tag * sin(2 * Pi / (2 * mid)));
        for (ll j = 0; j < cnum; j += 2 * mid) //枚举 cnum/2*mid个全长段
        {
            Complex w(1, 0);
            for (ll k = 0; k < mid; k++) //每段里面进行fft，不是<=，因为只有一半，不能超出
            {
                Complex buf = w * cm[j + k + mid];
                cm[j + k + mid] = cm[j + k] - buf; //在这一步cm[j + k] = cm[j + k] + buf上，否则cm[j+k]已被更改
                cm[j + k] = cm[j + k] + buf;
                w = w * wk;
            }
        }
    }
}

int fft_init(int n){     //n是最高次幂
    int maxx = 1, bits = 0;
    while ((maxx) <= n) {
        maxx <<= 1;
        bits++;
    }
    for(int i = 0; i <= maxx - 1; i ++){
        r[i] = (r[i >> 1] >> 1) | ((i & 1) << (bits - 1)); //求二进制反转结果
    }
    return maxx;
}
int nn;
void work(int maxx){
     fft(a , maxx , 1);
     fft(b , maxx , 1);
     for(int i = 0; i <= maxx; i ++){
        c[i] = a[i] * b[i];
     }
     fft(c , maxx , -1);
     for(int i = 0; i <= m * 2; i ++){
        vis[i] = (c[i].x / maxx + 0.5);
        res[i] = vis[i] / 2;
     }
     for(int i = 0; i <= maxx; i ++){
        a[i].x = b[i].x = c[i].x = 0;
        a[i].y = b[i].y = c[i].y = 0;
     }
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i = 1,x; i <= n; i ++){
        scanf("%d",&x);
        cnt[x] ++;
    }
    for(int i = 1; i <= m; i ++){
        if(cnt[i]) num[++temp] = cnt[i];
        ans[i * 2] = cnt[i] / 2;
    }
    sort(num + 1 , num + temp + 1);
    temp = unique(num + 1 , num + temp + 1) - num - 1;
    int maxx = fft_init(2 * m);
    for(int i = 1; i <= temp; i ++){
        int d = num[i];
        for(int j = 1; j <= m; j ++){
            if(cnt[j] >= d){
                a[j].x = 1;
                b[j].x = 1;
            }
        }
        work(maxx);
        for(int j = 1; j <= 2 * m; j ++){
            ans[j] += res[j] * (num[i] - num[i - 1]); 
        }
    }
    for(int i = 1; i <= 2 * m; i ++){
        if(ans[i] > ma){
            ma = ans[i];
            ans1 = i;
        }
    }
    printf ("%d %d\n",ma , ans1);
    return 0;
}