ACM模板_ne vgivin.docxVIP

ACM模板Nevgivin倍增：#include iostreamusing namespace std;constintmaxn =100005*2;/*字符要先转化为正整数待排序的字符串放在r 数组中，从r[0]到r[n-1]，长度为n，且最大值小于m。所有的r[i]都大于0,r[n]无意义算法中置0函数结束后，结果放在sa数组中(名次从1..n)，从sa[1]到sa[n]。s[0]无意义*/intcmp(int *r,inta,intb,int l)//{return r[a]==r[b]r[a+l]==r[b+l];}int r[maxn],sa[maxn]wa[maxn],wb[maxn],wv[maxn],ws1[maxn];void da(int *r,int *sa,intn,int m)//{r[n++]=0;inti,j,p,*x=wa,*y=wb,*t;for(i=0;im;i++)ws1[i]=0;for(i=0;in;i++)ws1[x[i]=r[i]]++;for(i=1;im;i++)ws1[i]+=ws1[i-1];for(i=n-1;i=0;i--)sa[--ws1[x[i]]]=i;for(j=1,p=1;pn;j*=2,m=p){for(p=0,i=n-j;in;i++) y[p++]=i;for(i=0;in;i++) if(sa[i]=j) y[p++]=sa[i]-j;for(i=0;in;i++) wv[i]=x[y[i]];for(i=0;im;i++) ws1[i]=0;for(i=0;in;i++) ws1[wv[i]]++;for(i=1;im;i++) ws1[i]+=ws1[i-1];for(i=n-1;i=0;i--) sa[--ws1[wv[i]]]=y[i];for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;in;i++)x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;}}/*height[2..n]:height[i]保存的是lcp(sa[i],sa[i-1])rank[0..n-1]:rank[i]保存的是原串中suffix[i]的名次*/int rank[maxn],height[maxn];voidcalheight(int *r,int *sa,int n){inti,j,k=0;for(i=1;i=n;i++)rank[sa[i]]=i;for(i=0;in;height[rank[i++]]=k)for(k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);}intlcp(inti,int j)//原串中suffix[i]与suffix[j]的lcp{//rmq解决//rank[i]rank[j]//return min(height[ rank[i]+1 ]......height[ rank[j] ])return 0;}DC3：#define F(x)((x)/3+((x)%3==1?0:tb))#define G(x)((x)tb?(x)*3+1:((x)-tb)*3+2)int r[maxn],sa[maxn],wa[maxn],wb[maxn],wv[maxn],wss[maxn];int c0(int*r,inta,int b){ return r[a]==r[b]r[a+1]==r[b+1]r[a+2]==r[b+2];}int c12(intk,int *r,inta,int b){if(k==2)return r[a]r[b]||r[a]==r[b]c12(1,r,a+1,b+1);else return r[a]r[b]||r[a]==r[b]wv[a+1]wv[b+1];}void sort(int*r,int*a,int*b,intn,int m){inti;for(i=0; in; i++)wv[i]=r[a[i]];for(i=0; im; i++)wss[i]=0;for(i=0; in; i++)wss[wv[i]]++;for(i=1; im; i++)wss[i]+=wss[i-1];for(i=n-1; i=0; i--)b[--wss[wv[i]]]=a[i];return;}void dc3(int*r,int*sa,intn,int m){inti,j,*rn=r+n,*san=sa+n,ta=0,tb=(n+1)/3,tbc=0,p;r[n]=r[n+1]=0;for(i=0; in; i++)if(i%3!=0)wa[tbc++]=i;sort(r+2,wa,wb,tbc,m);sort(r+1,