Cod sursa(job #1343113)
Utilizator | Data | 14 februarie 2015 21:43:01 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
var n,m,a,b,c,i,j,max:longint;
v:array[1..100001] of longint;
begin
assign(input,'arbint.in');
assign(output,'arbint.out');
reset(input);
read(n,m);
for i:=1 to n do
read(v[i]);
for i:=1 to m do begin
max:=0;
read(c,a,b);
if c=1 then
v[a]:=b;
if c=0 then begin
for j:=a to b do begin
if v[j]>max then max:=v[j];
end;
writeln(max);
end;
end;
end.