CF993E【FFT】

题目链接：http://codeforces.com/problemset/problem/993/E
AC代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn=8e5+10;
typedef long long ll;
#define PI acos(-1.0)
int cnt[maxn];
int sum[maxn];
ll ans[maxn];
struct Complex
{
    double x,y;
    Complex(double _x=0.0,double _y=0.0)
    {
        x=_x;
        y=_y;
    }
    Complex operator - (const Complex & b) const
    {
        return Complex(x-b.x,y-b.y);
    }
    Complex operator + (const Complex & b) const
    {
        return Complex(x+b.x,y+b.y);
    }
    Complex operator * (const Complex & b) const
    {
        return Complex(x*b.x-y*b.y,x*b.y+y*b.x);
    }
};
Complex y3[maxn],y2[maxn];
void change(Complex y[],int len)
{
    for(int i=1,j=len/2;i<len-1;i++)
    {
        if(i<j)
            swap(y[i],y[j]);
        int k=len/2;
        while(j>=k)
            j-=k,k/=2;
        if(j<k)
            j+=k;
    }
}
void fft(Complex y[],int len,int on)
{
    change(y,len);
    for(int h=2;h<=len;h<<=1)
    {
        Complex wn(cos(-on*2*PI/h),sin(-on*2*PI/h));
        for(int j=0;j<len;j+=h)
        {
            Complex w(1,0);
            for(int k=j;k<j+h/2;k++)
            {
                Complex u=y[k];
                Complex t=w*y[k+h/2];
                y[k]=u+t, y[k+h/2]=u-t;
                w=w*wn;
            }
        }
    }
    if(on==-1)
    {
        for(int i=0;i<len;i++)
        {
            y[i].x/=len;
        }
    }
}
int main()
{
    int n ,x;
    scanf("%d%d\n",&n,&x);
    memset(cnt,0,sizeof(cnt));
    memset(sum,0,sizeof(sum));
    int tmp;
    for(int i=1;i<=n;i++)
    {
        cin>>tmp;
        sum[i]=sum[i-1]+(tmp<x);
        cnt[sum[i]]++;
    }
    cnt[0]++;
    int len=1;
    while(len<=2*n)
        len=2*len;
    for(int i=0;i<=n;i++)
    {
        y2[i].x=cnt[i];
        y2[i].y=0;
        y3[n-i].x=cnt[i];
        y3[i].y=0;
    }
    fft(y2,len,1);
    fft(y3,len,1);
    for(int i=0;i<=len;i++)
        y2[i]=y2[i]*y3[i];
    fft(y2,len,-1);
    for(int i=0;i<=n;i++){
        ans[i]=(ll)(y2[i+n].x+0.5);
        if(i==0)
            ans[i]=(ans[i]-n-1)/2;
    }
    for(int i=0;i<=n;i++)
        cout<<ans[i]<<" ";
    puts("");
    return 0;
}

我一定可以的！！！