常用算法汇总.docVIP

常用算法汇总 1.快速排序 procedure quicksort(l,r:longint); var i,j,x:longint; begin i:=l; j:=r; x:=a[random(r-l+1)+l]; repeat while a[i]x do inc(i); while a[j]x do dec(j); if i=j then begin swap(a[i],a[j]); inc(i); dec(j); end; until ij; if ir then quicksort(i,r); if jl then quicksort(l,j); end; 2.线段树（附中1505） procedure insert1(x,k,l,r,p:longint); var mid:longint; begin if(pl)or(pr)then exit; if l=r then begin sum[k]:=x; exit; end; mid:=(l+r)shr 1; insert1(x,k shl 1,l,mid,p); insert1(x,k shl 1+1,mid+1,r,p); sum[k]:=sum[k shl 1]+sum[k shl 1+1]; end; procedure insert2(x,k,l,r,a,b:longint); var mid:longint; begin if(lb)or(ra)then exit; if(l=a)and(r=b)then begin f[k]:=true; sum[k]:=x*(r-l+1); exit; end; mid:=(l+r)shr 1; if f[k]=true then begin f[k]:=false; f[k shl 1]:=true; f[k shl 1+1]:=true; sum[k shl 1]:=sum[k]div(r-l+1); sum[k shl 1+1]:=sum[k shl 1]*(r-mid); sum[k shl 1]:=sum[k shl 1]*(mid-l+1); end; insert2(x,k shl 1,l,mid,a,b); insert2(x,k shl 1+1,mid+1,r,a,b); sum[k]:=sum[k shl 1]+sum[k shl 1+1]; end; function ask(k,l,r,a,b:longint):longint; var mid,o:longint; begin if(lb)or(ra)then begin ask:=0; exit; end; if(l=a)and(r=b)then begin ask:=sum[k]; exit; end; mid:=(l+r)shr 1; if f[k]=true then begin f[k]:=false; f[k shl 1]:=true; f[k shl 1+1]:=true; sum[k shl 1]:=sum[k]div(r-l+1); sum[k shl 1+1]:=sum[k shl 1]*(r-mid); sum[k shl 1]:=sum[k shl 1]*(mid-l+1); end; ask:=ask(k shl 1,l,mid,a,b)+ask(k shl 1+1,mid+1,r,a,b); end; 3.树状数组 function lowbit(x:longint):longint; begin lowbit:=x and(-x); end; procedure add(x:longint); begin while x=n do begin inc(c[x]); x:=x+lowbit(x); end; end; function sum(x:longint):longint; begin sum:=0; while x0 do begin sum:=sum+c[x]; x:=x-lowbit(x); end; end; 4.最短路径 (1)单源最短路径dijkstra procedure dijkstra; var i,j,w,min:longint; begin for