Cod sursa(job #144222)
Utilizator | Nezbeda Harald free2infiltrate | Data | 27 februarie 2008 12:57:39 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
program arbint;
var A : array [1..10000] of longint;
m,n,i,l,o,x,y,j,min : longint;
f,g : text;
begin
assign(f,'arbint.in');
reset(f);
readln(f,n,m);
assign(g,'arbint.out');
rewrite(g);
for i := 1 to n do
read(f,A[i]);
readln(f);
for l := 1 to n do begin
readln(f,o,x,y);
if o=0 then begin
min := A[x];
for j := x+1 to y do
if A[j]>min then min := A[j];
writeln(g,min);
end
else begin
min := A[x];
A[x] := A[y];
A[y] := min;
end;
end;
close(f);
close(g);
end.