wzf_2000的博客

#define N (100000+10) const double alpha=0.75; struct Node { Node *ch[2]; int key,size,cover;// size为有效节点的数量，cover为节点总数量 bool exist;// 是否存在（即是否被删除） void push_up() { size=c

int sa[N],Rank[N],height[N]; int wa[N],wb[N],wv[N],wd[N]; bool cmp(int *r,int a,int b,int l) { return r[a]==r[b]&&r[a+l]==r[b+l]; } void da(int *r,int n,int m) { int *x=wa,*y=wb,*t; for (int i=0;i<

FFT

struct edge { int from,to,cap,flow; edge(int u,int v,int c,int f):from(u),to(v),cap(c),flow(f){} }; vector e; vector G[N]; int d[N],cur[N]; bool vis[N]; int read() {

const int N=1100,INF=0x3f3f3f3f; const int M=N*N; int pre[N],d[N],p[N],ans; int cnt,head[N]; int q[M],l,r; struct edge { int u,v,w,c,next; }e[M]; void init() { memset(head,-1,sizeof(head)); ans=cnt

#include #define mod 998244353 #define N 400009 #define ll long long using namespace std; ll w[2][N],inv[N]; ll A[N],B[N],C[N],D[N],E[N],F[N]; ll W,G; ll pow(ll a,ll b,ll c) { ll ans=1; for (;b;a=a