gjghfd

题解#include<bits/stdc++.h> using namespace std; #define ll long long inline char nc(){ static char buf[100000],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:

%%%Manchery题解#include<bits/stdc++.h> using namespace std; #define ll long long inline char nc(){ static char buf[100000],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p

题解#include<bits/stdc++.h> using namespace std; #define N 500010 #define M 4000000 vector<char>c[N]; vector<int>a[N<<1],g[M]; int num,nx[N<<1][2],w[N<<1],w2[N<<1]; int i,j,k,n,m,p,pos[N],pr[N<<1],sf[N<<