Cod sursa(job #1086728)
| Utilizator | Data | 18 ianuarie 2014 14:49:59 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
program arbint_naiv;
var n,m,i,j,a,b,c,max:longint;
v:array[1..100000] of longint;
begin
assign(input,'arbint.in'); reset(input);
assign(output,'arbint.out'); rewrite(output);
readln(n,m);
for i:=1 to n do read(v[i]);
readln;
for i:=1 to m do
begin
readln(c,a,b);
if c=1 then v[a]:=b
else begin
max:=v[a];
for j:=a to b do if v[j]>max then max:=v[j];
writeln(max);
end;
end;
close(output);
end.
