20200608模拟赛 Endless

$n\le 3e5$

套路题，如果你做过「SCOI2016」萌萌哒。
那么这个题就直接写一个倍增并查集。

然后均摊分析一下发现可以写成线段树的形式，势能分析出来复杂度最高$n{\log }^{2}n$。

#include<bits/stdc++.h>
#define maxn 300005
#define lim 19
#define LL long long
#define S 131
#define mod 998244353
#define rep(i,j,k) for(int i=(j),LIM=(k);i<=LIM;i++)
#define per(i,j,k) for(int i=(j),LIM=(k);i>=LIM;i--)
using namespace std;

int n,a[maxn];
LL hs[maxn],pw[maxn],lg[maxn],ans;
LL calc(int a,int b){ return ((hs[b] - hs[a-1] * pw[b-a+1]) % mod + mod) % mod; }
int F[lim][maxn],w[maxn],c[maxn];
int Find(int *F,int u){ return !F[u] ? u : F[u] = Find(F,F[u]); }
bool cmp(const int &u,const int &v){ return w[u] < w[v]; }

void ins(int t,int a,int b,int w){
	int x = Find(F[t],a) , y = Find(F[t],b);
	if(x == y) return;
	F[t][x] = y;
	if(t == 0) return (void)(ans += w);
	ins(t-1,a,b,w),ins(t-1,a+(1<<t-1),b+(1<<t-1),w);
}

void add(int a,int b,int c,int d,int w){
	if(a > b) return;
	int t = lg[b-a+1];
	ins(t,a,c,w);
	ins(t,b-(1<<t)+1,d-(1<<t)+1,w);
}

int main(){
	
	freopen("endless.in","r",stdin);
	freopen("endless.out","w",stdout);
	
	int T;
	rep(i,2,maxn-1) lg[i]= lg[i>>1] + 1;
	for(scanf("%d",&T);T--;){
		scanf("%d",&n);
		pw[0] = 1;
		rep(i,1,n) scanf("%d",&a[i]) , hs[i] = (hs[i-1] * S + a[i]) % mod , pw[i] = pw[i-1] * S % mod;
		rep(j,0,lim-1) rep(i,1,n) F[j][i] = 0;
		rep(i,1,n/2) scanf("%d",&w[i]),c[i]=i;
		sort(c+1,c+1+n/2,cmp);
		ans = 0;
		rep(i,1,n/2){
			int u = c[i];
			for(int j=1;j+u<=n;j+=u){
				int lk=0,rk=0;
				int L=0,R=min(u,n-j-u+1),mid;
				for(;L<R;){
					mid = (L+R+1) >> 1;
					if(calc(j,j+mid-1) == calc(j+u,j+u+mid-1))
						L = mid;
					else 
						R = mid - 1;
				}
				rk = L;
				L = 0 , R = min(u,j);
				for(;L<R;){
					mid = (L+R+1) >> 1;
					if(calc(j-mid+1,j) == calc(j+u-mid+1,j+u))
						L = mid;
					else 
						R = mid - 1;
				}
				lk = L;
				if(lk + rk - 1 >= u)
					add(j-lk+1,j+rk-1,j+u-lk+1,j+u+rk-1,w[u]);
			}
		}
		printf("%lld\n",ans);
	}
}