BZOJ3509 [CodeChef] COUNTARI

考虑分块FFT

对位置分块，那么对两边的权值生成函数可以做FFT，那么块里的权值*2的位置就可以加到答案上

这样算出来的是3个都不在一块内的

有在一块内的暴力即可

暴力的技巧要好，要不然就会被卡常数-_-

#include<iostream>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<cstdlib>
#include<cstdio>
#include<map>
#include<bitset>
#include<set>
#include<stack>
#include<vector>
#include<queue>
using namespace std;
#define MAXN 100010
#define MAXM 70010
#define ll long long
#define eps 1e-8
#define MOD 1000000007
#define INF 1000000000
char xB[1<<15],*xS=xB,*xTT=xB;
#define getc() (xS==xTT&&(xTT=(xS=xB)+fread(xB,1,1<<15,stdin),xS==xTT)?0:*xS++)
#define isd(c) (c>='0'&&c<='9')
int read(){
	char xchh;
	int xaa;
    while(xchh=getc(),!isd(xchh));(xaa=xchh-'0');
    while(xchh=getc(),isd(xchh))xaa=xaa*10+xchh-'0';return xaa;
}
const double pi=acos(-1);
struct cl{
	double x;
	double y;
	cl(){
		
	}
	cl(double _x,double _y){
		x=_x;
		y=_y;
	}
	friend cl operator +(cl x,cl y){
		return cl(x.x+y.x,x.y+y.y);
	}
	friend cl operator -(cl x,cl y){
		return cl(x.x-y.x,x.y-y.y);
	}
	friend cl operator *(cl x,cl y){
		return cl(x.x*y.x-x.y*y.y,x.x*y.y+x.y*y.x);
	}
	friend cl operator /(cl x,double y){
		return cl(x.x/y,x.y/y);
	}
};
int n,mx;
int a[MAXN];
int S;
int bel[MAXN];
int st[MAXN],ed[MAXN];
cl A[MAXM],B[MAXM];
int N,L,R[MAXM];
ll ans;
int cf[MAXM],cb[MAXM];
void fft(cl *a,int f){
	int i,j,k;
	for(i=0;i<N;i++){
		if(i<R[i]){
			swap(a[i],a[R[i]]);
		}
	}
	for(i=1;i<N;i<<=1){
		cl wn(cos(pi/i),f*sin(pi/i));
		for(j=0;j<N;j+=i<<1){
			cl w(1,0);
			for(k=0;k<i;k++,w=w*wn){
				cl x=a[j+k],y=w*a[j+i+k];
				a[j+k]=x+y;
				a[j+i+k]=x-y;
			}
		}
	}
	if(f==-1){
		for(i=0;i<N;i++){
			a[i]=a[i]/N;
		}
	}
}
int main(){
	int i,j,k;
	n=read();
	S=min(n,2000);
	for(i=1;i<=n;i++){
		a[i]=read();
		mx=max(mx,a[i]);
		bel[i]=(i-1)/S+1;
		ed[bel[i]]=i;
		if(!st[bel[i]]){
			st[bel[i]]=i;
		}
	}
	for(N=1,L=0;N<=mx<<1;N<<=1){
		L++;
	}
	for(i=0;i<N;i++){
		R[i]=R[i>>1]>>1|((i&1)<<(L-1));
	}
	for(i=1;i<=n;i++){
		cb[a[i]]++;
	}
	for(i=1;i<=bel[n];i++){
		for(j=st[i];j<=ed[i];j++){
			cb[a[j]]--;
		}
		for(j=st[i];j<=ed[i];j++){
			for(k=j+1;k<=ed[i];k++){
				if(a[j]*2-a[k]>0){
					ans+=cf[a[j]*2-a[k]];
				}
				if(a[k]*2-a[j]>0){
					ans+=cb[a[k]*2-a[j]];
				}
			}
			cf[a[j]]++;
		}
	}
	for(i=1;i<=bel[n];i++){
		for(j=0;j<N;j++){
			A[j]=B[j]=cl(0,0);
		}
		for(j=1;j<st[i];j++){
			A[a[j]].x+=1;
		}
		for(j=ed[i]+1;j<=n;j++){
			B[a[j]].x+=1;
		}
		fft(A,1);
		fft(B,1);
		for(j=0;j<N;j++){
			A[j]=A[j]*B[j];
		}
		fft(A,-1);
		for(j=st[i];j<=ed[i];j++){
			ans+=(ll)(A[a[j]*2].x+0.1);
		}
	}
	printf("%lld\n",ans);
	return 0;
}

/*

*/