线段树标程分析【信息技术】.docVIP

1 2 3 4 5 6 7 8 9 10 Number:=Number+(Tree[Num].b-Tree[Num].a) =（3-2）+（5-3）+（7-5）+（10-8） =1+2+2+2 =7 附：线段树标程： {求[N,M]区间内K条线段覆盖的最长区间} Program IntervalTree; Const Maxn=10000; Type TreeNode=Record a,b,Left,Right,Cover:Longint; End; Var Tree:array [1..Maxn] of TreeNode; Number,Tot,c,d:Longint; Procedure MakeTree(a,b:Longint); Var Now:Longint; Begin Inc(Tot); Now:=Tot; Tree[Now].a:=a; Tree[Now].b:=b; Tree[Now].Cover:=0; If a+1b then begin Tree[Now].Left:=Tot+1; MakeTree(a,(a+b) div 2); {先建左子树} Tree[Now].Right:=Tot+1; MakeTree((a+b) div 2,b); {后建右子树} End; End; Procedure Insert(Num:Longint); Begin If (c=Tree[Num].a) and (Tree[Num].b=d) then {覆盖了的区间才做标记} Tree[Num].Cover:=Tree[Num].Cover+1 Else begin If c(Tree[Num].a+Tree[Num].b) div 2 then Insert(Tree[Num].Left); {先判断左子树} If d(Tree[Num].a+Tree[Num].b) div 2 then Insert(Tree[Num].Right); {后判断右子树} End; End; Procedure Delete(Num:Longint); {删除节点} Begin If (c=Tree[Num].a) and (Tree[Num].b=d) then Dec(Tree[Num].Cover) Else begin If c(Tree[Num].a+Tree[Num].b) div 2 then Delete(Tree[Num].Left); If d(Tree[Num].a+Tree[Num].b) div 2 then Delete(Tree[Num].Right); End; End; Procedure Count(Num:longint); Begin If Tree[Num].Cover0 then {该节点被覆盖，则不必考虑子节点（子节点一定被覆盖！）} Number:=Number+(Tree[Num].b-Tree[Num].a) Else begin If Tree[Num].Left0 then Count(Tree[Num].Left); If Tree[Num].Right0 then Count(Tree[Num].Right); End; End; Begin Assign(input,line.in);Reset(Input); Assign(output,line.out);Rewrite(Output); Readln(c,d); {读入基准区间} MakeTree(c,d); {建立线段树} While not eof do Begin Readln(c,d); {读入K条线段表示的新区间} Insert(1); {从第1个节点开始插入新的区间（做被新区间覆盖标记）} End; Count(1); {从第1个节点开始计算K条线段覆盖的区间长度} Writeln(Number); Close(input); Close(output); End. ① ② ③ ④ ⑤ ⑥ ⑦ ⑧ ⑨ ⑩ ⑾ ⑿ ⒀ ⒁ ⒂ ⒃ ⒄ Line.in 1 10 2 5 4 6 4 7 8 10