有点区间dp的意思,用线段树记录区间的ans,st搞RMQ
f[x,y]=max{f[x,mid],f[mid+1,y],maxnum(mid+1,y)-minnum(x,mid)}
我的code:
var
n,i,j,q,x,y:longint;
d,dd:array[1..400000,0..30] of longint;
l,r,v1,v2:array[1..1000000] of longint;
function max(a,b:longint):longint;
begin
if a>b then
exit(a)
else exit(b);
end;
function min(a,b:longint):longint;
begin
if a<b then
exit(a)
else exit(b);
end;
function bg(x,y:longint):longint;
var k:longint;
begin
k:=trunc(ln(y-x+1)/ln(2));
exit(max(d[......
阅读全文