Cod sursa(job #167819)
Utilizator | Data | 30 martie 2008 11:07:36 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
program abint;
var A : array [1..100000] of longint;
n,m,i,x,y,max,j : longint;
p : 0..1;
f,g : text;
begin
assign(f,'arbint.in');
reset(f);
assign(g,'arbint.out');
rewrite(g);
readln(f,n,m);
for i := 1 to n do
read(f,A[i]);
readln(f);
for i := 1 to n do begin
readln(f,p,x,y);
if p=0 then begin
max := 0;
for j := x to y do
if A[j]>max then max := A[j];
writeln(g,max);
end
else A[x] := A[y];
end;
close(f);
close(g);
end.