RMQ

var log,a:array[0..50005] of longint;
n,m,i,j,k,l,r:longint;
f,z:array[0..50005,0..100] of longint;

function max(a,b:longint):longint;
begin if a>b then exit(a);exit(b);end;

function min(a,b:longint):longint;
begin if a

begin
readln(n,m);
log[0]:=-1;
for i:=1 to n do
    begin
    read(a[i]);
    log[i]:=log[i>>1]+1;
    f[i][0]:=a[i];
    z[i][0]:=a[i];
    end;
for j:=1 to log[n] do
    for i:=1 to n do
        if (1<n+1 then break
    else begin f[i,j]:=max(f[i,j-1],f[i+1<<(j-1)][j-1]);
        Z[i,j]:=min(z[i,j-1],z[i+1<<(j-1)][j-1]);
        end;
for i:=1 to m do begin
    read(l,r);
    k:=log[r-l+1];
    writeln(max(f[l][k],f[r-1<     end;
end.

你可能感兴趣的:(RMQ)