代码仓库培训资料

1、代码仓库目录：01.【数学方法】矩阵快速藉02.【数学方法】高斯消元（na?ve版）03.【数学方法】高斯消元（mid版）04.【字符串啊】Manacher算法（回文串）05.【字符串啊】KMP（字符串匹配）06.【数据结构】线段树（ZKW单点修改）07.【数据结构】线段树（RMQ08.【数据结构】线段树（区间加+赋值）09.【数据结构】Splay树（未完全测试）/!10. 【数据结构】AVL树（平衡树）【图论图论】最小生成树（prim）【图论图论】次小生成树【图论图论】最大流（Dinic）【图论图论】LCA+最大生成树（truck）【动态规划】背包01,多重，完全矩阵模板#include&l

2、t;cstdio>#include<cstring>#include<iostream>usingnamespacestdtypedeflonglongllconstintp=9973；constintN=13;lln,m;structmatrixllaNN;introw,col;matrix():row(N),col(N)memset(a,0,sizeof(a);/?matrix(intx,inty):row(x),col(y)memset(a,0,sizeof(a);ll*operator(intx)returnax;matrixoperator*(matri

3、xx)matrixtmp;for(inti=0;i<=n+1;i+)for(intj=0;j<=n+1;j+)tmpij=0;for(intk=0;k<=n+1;k+)tmpij=(tmpij+aik*xkj)%Preturntmp;voidoperator*=(matrixx)*this=*this*x;matrixoperatorA(llx)matrixret;for(inti：=0;i<=n+1;i+)retii=1;matrixtmp=*this;for(;x;x>>=1,tmp*=tmp)if(x&1)ret*=tmp;returnret;

4、voidprint()for(inti：=0;i<=n+1;i+)for(intj=0;j<=n+1;j+)printf("%d",aij);puts("");高斯消元，判断有无解的#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<vector>usingnamespacestd;typedeflonglongLL;constdoubleEPS=1e-6;constintN=55;st

5、ructmatrixintaNN;introw,col;matrix():row(N),col(N)memset(a,0,sizeof(a);matrix(intx,inty):row(x),col(y)memset(a,0,sizeof(a);int*operator(intx)returnax;voidprint()for(inti=0;i<row;i+)for(intj=0;j<col;j+)printf("%d",aij);puts("");puts);intGauss(matrixa,intm,intn)intintcol,k为列号

6、,k为行号/col为列号,k为行号;for(k=0,col=0;k<m&&col<n;+k,+col)intr=k;/r为第col列的一个1for(inti=k;i<m;+i)if(aicol)r=i;if(!arcol)k-;continue;if(r!=k)for(inti=col;i<=n;+i)swap(ari,aki);for(inti=k+1;i<m+i)if(aicol)/消元for(intj=col;j<=n;+j)aij人=akj;for(inti=k;i<m;+i)if(ain)return-1;if(k<=n

7、)returnn-k;/返回自由元个数高斯消元，求出一组解的#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>#include<cmath>usingnamespacestd;constintN=1010;constdoubleEPS=1e-7;intm,n;doubleaNN,xN;intGauss(intm,intn)intcol=0,k=0;/col为列号,k为行号for(;intk<m&&col<n;+r=k;

8、k，+col)for(inti=k+1;i<m+i)if(fabs(aicol)>fabs(arcol)r=i;if(fabs(arcol)<EPS)k-;continue;)/列全为0if(r!=k)for(inti=col;i<=n;+i)swap(aki,ari);for(inti=k+1;iif(fabs(ai<m+i)/消元col)>EPS)doublet=aicol/akcol;for(intj=col;j<=n;j+)aij-=akj*ta)icol=0;)for(inti=k;i<m;+i)/无解if(fabs(ain)>E

9、PS)return-1;if(k<n)returnn-k;/自由元个数for(inti=n-1;i>=0;i-)/回带求解doubletemp=ain;for(intj=i+1;j<n;+j)temp-=xj*aij;xi=(temp/aii);)return0;)Manacher算法#include<cstdio>#include<string>#include<cstring>#include<iostream>#include<algorithm>usingnamespacestd;constintN=2333

10、33;/20W/在o(n)时间内算出以每个点为中心的最大回文串长度intManacher(stringst)intlen=st.size();int*p=newintlen+1;memset(p,0,sizeof(p);intmx=0,id=0;for(inti=1;i<=len;i+)if(mx>i)pi=min(p2*id-i,mx-i);elsepi=1;while(sti+pi=sti-pi)pi+;if(i+pi>mx)mx=i+pi;id=i;intma=0;for(inti=1;i<len;i+)ma=max(ma,pi);delete(p);return

11、ma-1;intmain()/freopen("fuck.in","r",stdin);charstN;while(scanf("%s",st)stringst0="$#"for(inti=0;sti!='0'i+)st0+=sti;st0+="#"printf("%dn",Manacher(st0);return0;KMP字符串匹配voidwhile(i<m)if(j=-11|bi=bj)if(b+else)elsejKMP(intnmemsetint

12、igetNextwhileifnext=nexti!=b+j)nexti=j;i=nextj;j;,int(mat,0,sizeof(mat);elseififm)=0,j=0;(m>(i<n&&j<m)(j=-11|ai=bj)i+,j+;j=nextj;(!i&&!j)break;(j=m)#include<cstdio>#include<cstring>usingnamespacestd;typedeflonglongllconstintN=100007;constintP=1000000007charaN,bN;

13、boolmatN;intnextN;llfN;voidgetNext(intm)inti=0,j=-1;next0=-1;mati=1;/printf("mat%dgetn",i);=nextj;线段树(ZKW大法)#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>usingnamespacestd;constintINF=0x3f3f3f3fconstintN=3000100;structlinetree#definelc(t<&

14、lt;1)#definerc(t<<1A1)intmiN,M;inlinevoidbuild(intn)M=1;while(M<n)M«=1;M-;memset(mi,INF,sizeof(mi);for(inti=1+M;i<=n+Mi+)scanf("%d”,&mii);for(intt=M;t>=1;t-)mit=min(milc,mirc);voidchange(intt,intx)for(mit+=M=x,t>>=1;t;t>>=1)mit=min(milc,mirc);intquery(intl,in

15、tr)intans=INF;for(l+=M-1,r+=M+1;lArA1;l>>=1,r>>=1)if(l&1)ans=min(ans,mil人1);if(r&1)ans=min(ans,mir人1);returnans;T;intmain()intn,q,ord,x,y;for(;scanf("%d"，&n);)T.build(n);for(scanf("%d"，&q);q-;)scanf("%d%d%d",&ord，&x,&y);if(ord)T.c

16、hange(x,y);elseprintf("%dn",T.query(x,y);return0;线段树（RMQ#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>usingnamespacestd;constconstintn,structintnodeintINF=0x3f3f3f3f;intN=600100;ans,m,aN;node(l,r,id;()()node)bN,(intx,inty,intz)(l=x;r=y;id=z;)

17、cN;inlineboolcmp1(nodea,nodeb)(returna.l<binlineboolcmp2(nodea,nodeb)(returna.r<bstructlinetree(#definelc(t<<1)l；)r；)#definerc(t<<1A1)#definemid(lt+rt>>1)intlN,rN,maN,miN,MtaN,tiN;inlinevoidbuild(intn)(M=1;while(M<n)M«=1;M-;memset(ma,0,sizeof(ma);memset(mi,INF,sizeof(

18、mi);memset(ta,0,sizeof(ta);memset(ti,INF,sizeof(ti);for(inti=1+M;i<=M*2+1;i+)li=ri=for(intt=M;t>=1;t-)lt=llc,rt=i-M;rrc;)inlinevoiddown(intt)(if(t>M)return;/leafnodemalc=max(malc,tat);marc=max(marc,tat);talc=max(talc,tat);tarc=max(tarc,tat);tat=0;milc=min(milc,tit);mirc=min(mirc,tit);tilc=m

19、in(tilc,tit);tirc=min(tirc,tit);tit=INF;)inlinevoidmaintain(intt)mat=max(malc,marc);mit=min(milc,mirc);)inlinevoidtag(intt,intx)mat=max(mat,x);mit=min(mit,x);tat=max(tat,x);tit=min(tit,x);)voidchange(intt,intL,intR,intx)if(L<=lt&&rt<=R)tag(t,x);return;/indown(t);if(L<=mid)change(lc,

20、L,R,x);if(mid<R)change(rc,L,R,x);maintain(t);)voidquery(intt)if(t>M)/leafnodebt-M=ct-M=node(mit,mat,t-M);return;)down(t);query(lc);query(rc);maintain(t);)T;线段树（区间加+赋值）#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>usingnamespacestdconstintN=260000

21、intn,m;structlinetree#definelc(t<<1)#definerc(t<<1A1)#definemid(lt+rt>>1)intlN,rN,MtagN,sumN,lenN,SetN;inlinevoidbuild(intn)M=1memset;while(M<n)M<<=1;M-;/getM(sum,0,sizeof(sum);memset(tag,0,sizeof(tag);memset(Set,0,sizeof(Set);for(inti=1+M;i<=M*2+1;i+)/leafif(i<=n+M)

22、scanf("%d"，&sumi);li=ri=i-M;leni=1;)for(intt=M;t>=1;t-)/fatherssumt=sumlc+sumrc;lt=llc,rt=rrc;lent=lenlc+lenrc;)inlinevoiddown(intt)if(t>M)Sett=tagt=0;return;)/leafnodeif(Sett)sumlc=Sett*lenlc;sumrc=Sett*lenrc;Setlc=Sett;Setrc=Sett;Sett=0;taglc=tagrc：=0;)if(tagt)sumlc+=tagt5"

23、;lenlc;sumrc+=tagt5"lenrc;taglc+=tagt;tagrc+=tagt;tagt=0;inlinevoid_tag(intt,intx)(sumt+=x*lent;tagt+=x;inlinevoid_set(intt,intx)(sumt=x*lent;Sett=x;tagt=0;voidchange(intt,intL,intR,intxif(L<=lt&&rt<=R)(_tag(t,x);)return;down(t);if(L<=mid)change(lc,L,R,x);if(mid<R)change(rc,

24、L,R,x);sumt=sumlc+sumrc;voidset(intt,intL,intR,intx)(if(L<=lt&&rt<=R)_set(t,x);return;/indown(t);if(L<=mid)set(lc,L,R,x);if(mid<R)set(rc,L,R,x);sumt=sumlc+sumrc;intquery(intt,intL,intR)if(L<=lt&&rt<=R)returnsumdown(t);intans=0;if(L<=mid)ans+=query(lc,L,R);if(mid&

25、lt;R)ans+=query(rc,L,R);returnans;t;T；Splay-Tree#include<cstdio>#include<algorithm>usingnamespacestd;structNodeintkey;/sizeNode*l,*r,*f;/left,right,father;classSplayTreepublic:voidInit()rt=NULL;voidZag(Node*x)/leftrotateNode*y=x->f;/yisthefatherofxy->r=x->l;if(x->l)x->l-&g

26、t;f=y;/ifxhasleftchildx->f=y->f;if(y->f)/yisnotrootif(y=y->f->l)y->f->l=x;/yifleftchildelsey->f->r=x;/yisrightchildy->f=x;x->l=y;voidZig(Node*x)/rightrotateNode*y=x->f;/yisthefatherofxy->l=x->r;if(x->r)x->r->f=y;x->f=y->f;if(y->f)if(y=y->

27、;f->l)y->f->l=x;elsey->f->r=x;y->f=x;x->r=y;voidSplay(Node*x)while(x->f)Node*p=x->f;if(!p->f)if(x=p->l)Zig(x);elseZag(x);elseif(x=p->l)if(p=p->f->l)Zig(p);Zig(x);elseZig(x);Zag(x);)else(/x=p->rif(p=p->f->r)(Zag(p);Zag(x);)else(Zag(x);Zig(x);)rt=x;)N

28、ode*Find(intx)(Node*T=rt;while(T)(if(T->key=x)(Splay(T);returnT;)elseif(x<T->key)T=T->l;elseT=T->r;)returnT;)voidInsert(intx)(Node*T=rt,*fa=NULL;while(T)(fa=T;if(x<T->key)T=T->l;elseif(x>T->key)T=T->r;elsereturn;/twothesamekeys)T=(Node*)malloc(sizeof(Node);T->key=

29、x;T->l=T->r=NULL;T->f=fa;if(fa)(if(fa->key>x)fa->l=T;elsefa->r=T;)Splay(T);)voidDelete(intx)(Node*T=Find(x);if(NULL=T)return;/errorrt=Join(T->l,T->r);)Node*Maxnum(Node*t)(Node*T=t;while(T->r)T=T->r;Splay(T);returnT;)Node*Minnum(Node*t)(Node*T=t;while(T->l)T=T->

30、lSplay(T);)returnT;Node*Last(intx)(Node*T=Find(x);T=T->l;)return(Maxnum(T);Node*Next(intx)(Node*T=Find(x);T=T->r;return(Minnum(T);)Node*Join(Node*t1,Node*t2)(if(NULL=t1)returnt2;if(NULL=t2)returnt1;Node*T=Maxnum(t1);T->l=t2;returnT;)voidSplit(intx,Node*&t1,Node*&t2)(Node*T=Find(x);t

31、1=T->l;t2=T->r;)voidInorder(Node*T)(if(NULL=T)return;Inorder(T->l);printf("%d->",T->key);Inorder(T->r);)void_Delete()(Delete(rt);)voidDelete(Node*T)(if(NULL=T)return;Delete(T->l);Delete(T->r);free(T);)private:Node*rt;/root);AVL树/codevs1285蒲?/bycww97#include<cstdi

32、o>#include<iostream>#include<algorithm>#defineINF0xfffffff#defineBASE1000000usingnamespacestd;intans=0;structNodeintx,bf,h;/bf=balancefactor,h=heightNode*l,*r;classAVLTreepublic:voidInit()rt=NULL;intH(Node*T)return(T=NULL)?0:T->h;intBF(Node*l,Node*r)/getbalancefactorif(NULL=l&&

33、amp;NULL=r)return0;elseif(NULL=l)return-r->h;elseifreturnl(NULL=r)returnl->->h-r->h;h;Node*Lrorate(Node*a)/leftrorateNode*b;b=a->r;a->r=b->l;b->l=a;a->h=max(H(a->l),H(a->r)+1b->h=max(H(b->l),H(b->r)+1a->bf=BF(a->l,a->r);b->bf=BF(b->l,b->r);

34、returnbNodeNode*b;b=a->l;a->l=b->r;b->r=a;a->h=max(H(a->l),H(a->r)+1b->h=max(H(b->l),H(b->r)+1a->bf=BF(a->l,a->r);b->bf=BF(b->l,b->r);returnb)NodeaNodec)NodeaNodec)* LRrorate(Node*a)(->l=Lrorate(a->l);*c;=Rrorate(a);returnc;* RLrorate(Node*a)(-&g

35、t;r=Rrorate(a->r);*c;=Lrorate(a);returnc;/leftthenright/rightthenleftvoidInsert(intx)(_Insert(rt,x);)void_Insert(Node*&T,intx)(if(NULL=T)(T=(Node*)malloc(sizeof(Node);T->x=x;T->bf=0;T->h=1;T->l=T->r=NULL;return;)if(x<T->x)_Insert(T->l,x);elseif(x>T->x)_Insert(T-&

36、gt;r,x);elsereturn;/error:thesameyT->h=max(H(T->l),H(T->r)+1;/maintainT->bf=BF(T->l,T->r);if(T->bf>1IIT->bf<-1)/notbalancedif(T->bf>0&&T->l->bf>0)T=Rrorate(T);elseif(T->bf<0&&T->r->bf<0)T=Lrorate(T);elseif(T->bf>0&

37、&T->l->bf<0)T=LRrorate(T);elseif(T->bf<0&&T->r->bf>0)T=RLrorate(T);voidGetPet(intx)(/getpetorpersonif(NULL=rt)(return;)intsmall=0,large=INF;/printf("x=%dn”,x);intflag;if(Find(rt,x,small,large)(printf("find%dn",x);_Delete(rt,x);)elseif(small=0)flag=1

38、;elseif(large=INF)flag=0;elseif(large-x<x-small)flag=1elseflag=0;if(!flag)(/chooselarge_Delete(rt,small);ans=(ans+x-small)%BASE;)else(_Delete(rt,large);ans=(ans+large-x)%BASE;)&large)(boolFind(Node*T,intx,int&small,intif(NULL=T)return0;if(x=T->x)return1;if(x<T->x)(large=min(large

39、,T->x);returnFind(T->l,x,small,large);)else(small=max(small,T->x);returnFind(T->r,x,small,large);)void_Delete(Node*&T,intx)(if(NULL=T)return;if(x<T->x)(/yatleft_Delete(T->l,x);T->bf=BF(T->l,T->r);if(T->bf<-1)(if(1=T->r->bf)T=RLrorate(T);elseT=Lrorate(T);

40、/bf=0or-1)elseif(x>T->x)(/yatrightDelete(T->r,x);->ifbf=BF(T->l,T->r);(T->bf>1)(if(-1=T->l->bf)T=LRrorate(T);elseT=Rrorate(T);/bf=0or1)elseif(/hereisx(T->l&&T->r)(/left&&rightNodet=T->lDeletewhile->x=t(t->r)->x;(T->lt=t->r;-t->

41、x);->bf=BF(T->l,T->r);if)elseNodeif(T->bf<-1)(if(1=T->r->bf)T=RLrorate(T);elseT=Lrorate(T);/bf=0or-1(/left|right*t=T;(T->l)T=T->l;elseif(T->r)T=T->r;else(free(T);T=NULL;)if(T)free(t);/Debug,youwillnotneeditatthisproblemvoidshow()(InOrder(rt);puts("EndShow")

42、;)voidInOrder(Node*T)(/printlrtrif(NULL=T)return;InOrder(T->l);printf("%d",T->x);InOrder(T->r);)voidFree()(FreeTree(rt);)voidFreeTree(Node*T)(if(NULL=T)return;FreeTree(T->l);FreeTree(T->r);free(T);)private:Node*rt;/root)；intmain()(freopen("fuck.in","r",st

43、din);intn,x,op,a=0,b=0;scanf("%d"，&n);AVLTreeT;T.Init();for(;n-;)(scanf("%d%d",&op,&x);/ifpets>peopleputpetsintothetree/elseputpeopleintothetreeif(op=0)(/comeapeta+;if(a>b)T.Insert(x);/morepetelseT.GetPet(x);/morepeople)else(/comeapersonb+;if(a<b)T.Insert(x);

44、/morepeopleelseT.GetPet(x);/morepet)printf("%dn",ans%BASE);T.Free();return0;最小生成树(prim),hdu1102#include<cstdio>#include<cstring>#include<iostream>usingnamespacestd;constintN=107;intn,gNN;intprim()intminwN;/MinWeightboolusedN;memset(used,0,sizeof(used);memset(minw,0x7f,siz

45、eof(minw);minw1=0;intsum=0;while(1)intv=-1;for(inti=1;i<=n;i+)if(!usedi&&(v=-11|minwi<minwv)v=i;if(v=-1)break;usedv=1;sum+=minwv;for(inti=0;i<=n;i+)minwi=min(minwi,gvi);returnsum;)intmain()(for(;scanf("%d"，&n)=1;)(for(inti=1;i<=n;i+)for(intj=1;j<=n;j+)scanf("

46、;%d",&gij);intx,y,q;scanf("%d"，&q);for(;q-;)(scanf("%d%d"，&x,&y);gxy=gyx=0;)printf("%dn",prim();)return0;)次小生成树hdu4081/hdu4081次小生成树#include<cmath>#include<cstdio>#include<cstring>#include<iostream>usingnamespacestd;constintN=

47、1007;intn;doublegNN,maxwNN;boolusedNN;structCity(intx,y,w;/w=populationCity():x(0),y(0),w(0)()City(intx,inty,intw):x(x),y(y),w(w)citysN;doubledist(Citya,Cityb)(returnsqrt(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);)doubleprim()(intfromN;boolvisN;doubleminwN;for(inti=1;i<=n;i+)(minwi=g1i;fromi=1;)mems

48、et(used,0,sizeof(used);memset(maxw,0,sizeof(maxw);memset(vis,0,sizeof(vis);vis1=:1;minw1=0;doublesum=0;while(1)(intv=-1;for(inti=1;i<=n;i+)if(!visif(v=-11|minwi<minwv)if(v=-1)break;usedvfromv=usedfromvvisv=1;sum+=minwv;for(inti=1;i<=n;i+)(if(!visi&&gvi<minwminwi=gvi;fromi=v;v=1;)

49、i)(i)(v=i;ifmaxw(visi&&i!=v)(iv=maxwvi=max(maxwifromv,minwv);)sumintmain)return()(/freopen("fuck.in","r",stdin);intT;scanf("%d"，&T);for(;scanfT-；)("%d"，&n);intx,y,z;for(inti=1;i<=n;i+)(scanfcitys("%d%d%d"，&x,&y,&z);i=Ci

50、ty(x,y,z);for(inti=1;i<=n;i+)for(intj=1;j<=n;j+)ij=dist(citysi,citysj);doublesum=prim(),ans=-1;for(inti=1;i<=n;i+)(for(intj=i+1;j<=n;j+)(if(usedij)ans=max(ans,(citysi.w+citysj.w)/(sum-gij);elseans=max(ans,(citysi.w+citysj.w)/(sum-maxwij);printf("%.2lfn",ans);return0;最大流(Dinic)#

51、include<queue>#include<cstdio>#include<vector>#include<string>#include<cstring>#include<iostream>usingnamespacestd;typedeflonglongLL;constintINF=0x3f3f3f3f;constintN=23<<1;intn,m,aN,bN,ansNN;structgragh(intfrom,to,cap,flow;Edge(intu,intv,intc,intf):from(u),t

52、o(v),cap(c),flow(f)()；ints,t;/0=s,1nAn+1n+mPn+m+1=tvector<Edge>edges;vector<int>GN;/graghboolvisN;/usewhenbfsintdN,curN;/dist,nowedge,useindfsinlinevoidAddEdge(intfrom,intto,intcap)(edges.push_back(Edge(from,to,cap,0);edges.push_back(Edge(to,from,0,0);inttop=edges.size();Gfrom.push_back(

53、top-2);Gto.push_back(top-1);)inlineboolBFS()(memset(vis,0,sizeof(vis);queue<int>Q;Q.push(s);ds=0;viss=1;while(!Q.empty()(intx=Qfront();Q.pop();for(inti=0;i<Gx.size();i+)(Edge&e=edgesGxi;if(vise.to|e.cap<=e.flow)continuevise.to=1;de.to=dx+1;Q.push(e.to);)returnvist;)inlineintDFS(const

54、int&x,inta)(/printf("dfs:%d,%dn",x,a);if(x=t|a=0)(returna;)intflow=0,f;for(int&i=curx;i<Gx.size();i+)(Edge&e=edgesGxi;if(dx+1!=de.to)continue;if(f=DFS(e.to,min(a,e.cap-e.flow)<=0)continuee.flow+=f;edgesGxi叶1.flow-=f;/?flow+=f;a-=f;if(a=0)break;returnflow;)inlineintmaxflow()(returnMaxflow(s,t);inlineintMaxflow(constint&s,constint&t)(intflow=0;memset(ans,0,sizeof(ans);while(BFS()(m