用jsp 怎么设计 树形目录啊

来源:百度知道 编辑:UC知道 时间:2024/09/22 02:07:26
用jsp 怎么设计 树形目录啊 急。。。。。。。。。。。。。

const
maxn=50;
maxm=1024;
var
block: array[1..maxn]of longint;
sumblock: array[0..maxm]of longint;
box: array[1..maxn]of longint;
sumbox: array[0..maxn]of longint;
use: array[1..maxm+1]of boolean;
n ,m ,mid ,sum ,ans: longint;
ok: boolean;
procedure qs(l ,r: longint);
var
i ,j ,x ,t: longint;
begin
i:=l;j:=r;x:=block[(l+r) shr 1];
repeat
while block[i]<x do inc(i);
while block[j]>x do dec(j);
if i<=j then begin
t:=block[i];block[i]:=block[j];block[j]:=t;
inc(i);dec(j);
end;
until i>j;
if i<r then qs(i,r);
if l<j then qs(l,j);
end;
procedure init;
var
i: longint;
begin
readln(n);
fillchar(box,sizeof(box),0);
fillchar(sumbox,sizeof(sumbox),0);
for i:= 1 to n do begin
readln(box[i]);
sumbox[i]:=sumbox[i-1]+box[i];
end;
readln(m);
fillchar(block,size