【BZOJ 1067】[SCOI2007]降雨量 线段树

裸的线段树或者rmq，反正没有修改，就是居然会有给没有出现过的年份的情况，wa了一发

#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define maxn 50021#define ls u<<1,l,mid#define rs u<<1|1,mid+1,r#define inf 0x3fffffffusing namespace std;int n,m,t[maxn],cnt,Max[maxn*4],cur[maxn];pair<int,int>q[maxn];inline int Q(int x){return lower_bound(t+1,t+1+cnt,x)-t;}void push_up(int u){Max[u]=max(Max[u<<1],Max[u<<1|1]);}void build(int u,int l,int r){if(l==r){Max[u]=cur[l];return;}int mid=l+r>>1;build(rs),build(ls);push_up(u);}int query(int u,int l,int r,int x,int y){if(x>y)return -inf;if(l==x&&r==y)return Max[u];int mid=l+r>>1;if(x>mid)return query(rs,x,y);else if(y<=mid)return query(ls,x,y);else return max(query(ls,x,mid),query(rs,mid+1,y));}int main(){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d%d",&q[i].first,&q[i].second),t[++cnt]=q[i].first;sort(t+1,t+1+cnt);cnt=unique(t+1,t+1+cnt)-t-1;for(int i=1;i<=n;i++){cur[Q(q[i].first)]=q[i].second;}build(1,1,cnt);scanf("%d",&m);int a,b,x,y;while(m--){scanf("%d%d",&a,&b);x=Q(a),y=Q(b);if(a==b)puts("true");else if(a!=t[x]||b!=t[y]){if(a!=t[x]&&b!=t[y])puts("maybe");else{int v,l,r;if(a!=t[x])v=cur[y],l=x,r=y-1;//x不给出 else v=cur[x],l=x+1,r=y-1;//y不给出if(query(1,1,cnt,l,r)>=v)puts("false");else puts("maybe");}}else if(cur[x]<cur[y]){puts("false");}else if(query(1,1,cnt,x+1,y-1)>=cur[y]){puts("false");}else if(y-x!=b-a){puts("maybe");}else puts("true");}return 0;}