CodeVs——T 3304 水果姐逛水果街Ⅰ

 1 #include <algorithm>
 2 #include <cstdio>
 3 
 4 using namespace std;
 5 
 6 const int N(200000+15);
 7 int n,m,u,v;
 8 
 9 struct TypeTree
10 {
11     int l,r,mid;
12     int maxx,minn,u_v,v_u;
13 }tree[N<<2],INF;
14 void Tree_up(int now)
15 {
16     tree[now].maxx=max(tree[now<<1].maxx,tree[now<<1|1].maxx);
17     tree[now].minn=min(tree[now<<1].minn,tree[now<<1|1].minn);
18     tree[now].u_v=max(tree[now<<1].u_v,tree[now<<1|1].u_v);
19     tree[now].u_v=max(tree[now].u_v,tree[now<<1|1].maxx-tree[now<<1].minn);
20     tree[now].v_u=max(tree[now<<1].v_u,tree[now<<1|1].v_u);
21     tree[now].v_u=max(tree[now].v_u,tree[now<<1].maxx-tree[now<<1|1].minn);
22 }
23 void Tree_build(int now,int l,int r)
24 {
25     tree[now].l=l; tree[now].r=r;
26     if(l==r)
27     {
28         scanf("%d",&tree[now].maxx);
29         tree[now].minn=tree[now].maxx;
30         tree[now].u_v=tree[now].v_u=0;
31         return ;
32     }
33     tree[now].mid=l+r>>1;
34     Tree_build(now<<1,l,tree[now].mid);
35     Tree_build(now<<1|1,tree[now].mid+1,r);
36     Tree_up(now);
37 }
38 TypeTree Tree_query(int now,int l,int r)
39 {
40     if(tree[now].l>=l&&tree[now].r<=r) return tree[now];
41     TypeTree temp=INF,tl=INF,tr=INF;
42     if(tree[now].mid>=r) temp=Tree_query(now<<1,l,r);
43     else if(tree[now].mid<l) temp=Tree_query(now<<1|1,l,r);
44     else
45     {
46         tl=Tree_query(now<<1,l,tree[now].mid);
47         tr=Tree_query(now<<1|1,tree[now].mid+1,r);
48         temp.maxx=max(tl.maxx,tr.maxx);
49         temp.minn=min(tl.minn,tr.minn);
50         temp.u_v=max(tr.maxx-tl.minn,max(tl.u_v,tr.u_v));
51         temp.v_u=max(tl.maxx-tr.minn,max(tl.v_u,tr.v_u));
52     }
53     return temp;
54 }
55 
56 int main()
57 {
58     scanf("%d",&n);
59     Tree_build(1,1,n);
60     INF.minn=1e9,INF.maxx=-23333,INF.u_v=-23333,INF.v_u=-23333;
61     scanf("%d",&m);
62     for(;m--;)
63     {
64         scanf("%d%d",&u,&v);
65         if(u==v) puts("0");
66         else if(u<v) printf("%d\n",Tree_query(1,u,v).u_v);
67         else printf("%d\n",Tree_query(1,v,u).v_u);
68     }
69     return 0;
70 }