模块化代码

NOIP2009复习资料之------模块化代码一、排序算法vara:array[1..maxn]of longint;——排序对象1．选择排序——Select_sortprocedure select_sort;beginfor i:=1 to n-1 dofor j:=i+1 to n doif a[i]>a[j] thenbegin temp:=a[i];a[i]:=a[j];a[j]:=temp;end; end;2．快速排序——Quick_sortprocedure qsort(s,t:longint);vari,j,x:longint;begini:=s;j:=t;x:=a[(i+j)div 2];repeatwhile a[i]<x do inc(i); {找左边比他大的} while a[j]>x do dec(j);{找右边比他小的}if i<=j then{交换}begintemp:=a[i];a[i]:=a[j];a[j]:=temp;inc(i);dec(j);end;until i>j;if s<j then qsort(s,j);if i<t then qsort(i,t);end;3. 桶排序(n是数据个数)var a:array[1..100] of integer: i,n,x;integer; beginread(n);for i:=1 to n dobeginx:=0;read(x);a[n]:=inc(a[n]);end;for i:=1 to 100 dowhile a[i]>0 dobeginwrite(i:4);a[i]:=a[i]-1;end;4．堆排序：procedure Swap(var a,b:longint);var c:longint;beginc:=a; a:=b; b:=c;end;procedure Sift(i,n:longint);var k,t:longint;begint:=a[i]; k:=i shl 1;while k<=n dobeginif (a[k+1]>a[k])and(k<n) then inc(k);if a[k]>tthen begina[i]:=a[k]; i:=k; k:=i shl 1;endelse break;end;a[i]:=t;end;procedure Heap_Sort;var i,j:longint;beginfor i:=n shr 1 downto 1 doSift(i,n);for i:=n-1 downto 1 dobeginSwap(a[i+1],a[1]);Sift(1,i);end;end;二、高精度算法——High_precisionconstmaxcount=进制位maxlen=记录高精度数组大小typebignum=array[0..maxlen]of longint;0为位数1．高精度加法procedure add(a,b:bignum;var c:bignum); vari:longint;beginfillchar(c,sizeof(c),0);c[0]:=1;if a[0]>b[0]then c[0]:=a[0]else c[0]:=b[0];for i:=1 to a[0] do inc(c[i],a[i]);for i:=1 to b[0] do inc(c[i],b[i]);for i:=1 to c[0] dobegininc(c[i+1],c[i] div maxcount);c[i]:=c[i] mod 10;end;while c[c[0]+1]>0 dobegininc(c[0]);inc(c[c[0]+1],c[c[0]] div maxcount);c[c[0]]:=c[c[0]] mod maxcount;end;end;2．高精度减法procedure minus(a,b:bignum;var c:bignum); vari:longint;beginfillchar(c,sizeof(c),0);c[0]:=a[0];for i:=1 to c[0] do c[i]:=a[i]-b[i];for i:=1 to c[0] doif c[i]<0 thenbegindec(c[i+1]);inc(c[i],maxcount);end;while (c[0]>1)and(c[c[0]]=0) do dec(c[0]);end;3．单精度乘法procedure mulnum(a:bignum;x:longint,var c:bignum); vari:longint;beginfillchar(c,sizeof(c),0);c[0]:=a[0];for i:=1 to c[0] do c[i]:=a[i]*x;for i:=1 to c[0] dobegininc(c[i+1],c[i] div maxcount);c[i]:=c[i] mod 10;end;while c[c[0]+1]>0 dobegininc(c[0]);inc(c[c[0]+1],c[c[0]] div maxcount);c[c[0]]:=c[c[0]] mod maxcount;end;end;4．高精度乘法procedure mul(a,b:bignum;var c:bignum);vari,j:longint;beginfillchar(c,sizeof(c),0);c[0]:=a[0]+b[0]-1;for i:=1 to a[0] dofor j:=1 to b[0] doinc(c[i+j-1],a[i]*b[j]);for i:=1 to c[0] dobegininc(c[i+1],c[i] div maxcount);c[i]:=c[i] mod 10;end;while c[c[0]+1]>0 dobegininc(c[0]);inc(c[c[0]+1],c[c[0]] div maxcount);c[c[0]]:=c[c[0]] mod maxcount;end;end;5．单精度除法function divnum(a:bignum;x:longint;var c:bignum):longint; vari,temp:longint;beginfillchar(c,sizeof(c),0);c[0]:=a[0];temp:=0;for i:=a[0] downto 1 dobegintemp:=temp*maxcount+a[i];c[i]:=temp div x;temp:=temp mod x;end;while (c[0]>1)and(c[c[0]]=0) do dec(c[0]);exit(temp);end;6．高精度除法procedure div(a,b:bignum;var c,d:bignum);vari:longint;beginfillchar(c,sizeof(c),0);c[0]:=a[0]-b[0]+1;fillchar(d,sizeof(d),0);d[0]:=1;for i:=c[0] downto 1 dobeginc[i]:=maxcount;repeatdec(c[i]);mul(c,b,temp);until compare(a,temp)>=0;end;while (c[0]>1)and(c[c[0]]=0) do dec(c[0]);minus(a,temp,d);end;3．图论1．Floyd:procedure floyed;beginfor I:=1 to n dofor j:=1 to n doif a[I,j]>0 then p[I,j]:=I else p[I,j]:=0; {p[I,j]表示I到j的最短路径上j的前驱结点} for k:=1 to n do {枚举中间结点}for i:=1 to n dofor j:=1 to n doif a[i,k]+a[j,k]a[i,j]:=a[i,k]+a[k,j];p[I,j]:=p[k,j];end;end;2．Dijkstra:vara:array[1..maxn,1..maxn] of integer;b,pre:array[1..maxn] of integer; {pre指最短路径上I的前驱结点}mark:array[1..maxn] of boolean;procedure dijkstra(v0:integer);beginfillchar(mark,sizeof(mark),false);for i:=1 to n do begind:=a[v0,i];if d<>0 then pre:=v0 else pre:=0;end;mark[v0]:=true;repeat {每循环一次加入一个离1集合最近的结点并调整其他结点的参数} min:=maxint; u:=0; {u记录离1集合最近的结点}for i:=1 to n doif (not mark) and (du:=i; min:=d;end;if u<>0 then beginmark:=true;for i:=1 to n doif (not mark) and (a[u,i]+dd:=a[u,i]+d;pre:=u;end;end;until u=0;end;3．传递闭包：Procedure Longlink;VarT:array[1..maxn,1..maxn] of boolean;BeginFillchar(t,sizeof(t),false);For k:=1 to n doFor I:=1 to n doFor j:=1 to n do T[I,j]:=t[I,j] or (t[I,k] and t[k,j]);End;4*．SPFA（实际上是Bellman-ford，此法可替代Dijkstra）constmaxp=10000; {最大结点数}var {变量定义}p,c,s,t:longint; {p,结点数;c,边数;s:起点;t:终点}a,b:array[1..maxp,0..maxp] of longint; {a[x,y]存x,y之间边的权;b[x,c]存与x 相连的第c个边的另一个结点y}d:array[1..maxp] of integer; {队列}v:array[1..maxp] of boolean; {是否入队的标记}dist:array[1..maxp] of longint; {到起点的最短路}head,tail:longint; {队首/队尾指针}procedure init;vari,x,y,z:longint;beginread(p,c);for i := 1 to c dobeginreadln(x,y,z); {x,y:一条边的两个结点;z:这条边的权值}inc(b[x,0]); b[x,b[x,0]] := y; a[x,y] := z; {b[x,0]：以x为一个结点的边的条数} inc(b[y,0]); b[y,b[y,0]] := x; a[y,x] := z;end;readln(s,t); {读入起点与终点}end;procedure spfa(s:longint); ｛SPFA｝vari,,j,now,sum:longint;beginfillchar(d,sizeof(d),0);fillchar(v,sizeof(v),false);for j := 1 to p do dist[ j ]:=maxlongint;dist[s] := 0; v[s] := true; d[1] := s; {队列的初始状态,s为起点} head := 1; tail := 1;while head<=tail do {队列不空}beginnow := d[head]; {取队首元素}for i := 1 to b[now,0] doif dist[b[now,i]]>dist[now]+a[now,b[now,i]] thenbegindist[b[now,i]]:= dist[now]+a[now,b[now,i]]; {修改最短路}if not v[b[now,i]] then {扩展结点入队}begininc(tail);d[tail] := b[now,i];v[b[now,i]] := true;end;end;v[now] := false; {释放结点}inc(head); {出队}end;end;procedure print;beginwriteln(dist[t]);end;begininit;spfa(s);print;end.4．搜索1．DFS框架NOIP2001 数的划分procedure work(dep,pre,s:longint); {入口为work(1,1,n)}{dep为当前试放的第dep个数,pre为前一次试放的数,s为当前剩余可分的总数}递归式：procedure try(dep:integer);var i:integer;beginif dep=k then beginif tot>=a[dep-1] then inc(sum);exit; end;for i:=a[dep-1] to tot div 2 do begina[dep]:=i; dec(tot,i);try(dep+1);inc(tot,i);end;end;{try}2。