BZOJ1067: [SCOI2007]降雨量(线段树)

题意：传送门

题解：这个题超级繁琐，参考传送门，传送门，我觉得本题的重点在于如何在线段树上加信息，使得中间漏掉的年份得以知道，有两种方法，通过维护区间和，提前建树时将不相邻年份设为0，还有一种方法是加标记。

附上代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn=5e4+50;
inline int read()
{
    char ch=getchar();
    int f=1,x=0;
    while(!(ch>='0'&&ch<='9')){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
    return x*f;
}
struct data{int mx,sum;}t[maxn<<2];
int n,m,a[maxn],c[maxn];
void up(int k)
{
    t[k].mx=max(t[k<<1].mx,t[k<<1|1].mx);
    t[k].sum=t[k<<1].sum+t[k<<1|1].sum;
}
void build(int k,int l,int r)
{
    if(l==r){
        t[k].mx=a[l];
        t[k].sum=c[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(k<<1,l,mid);
    build(k<<1|1,mid+1,r);
    up(k);
}
int querymax(int k,int l,int r,int x,int y)
{
    if (l>r||x>y) return -2e9;
    if(x==l&&y==r)return t[k].mx;
    int mid=(l+r)>>1;
    if(y<=mid)return querymax(k<<1,l,mid,x,y);
    else if(x>mid)return querymax(k<<1|1,mid+1,r,x,y);
    else return max(querymax(k<<1,l,mid,x,mid),querymax(k<<1|1,mid+1,r,mid+1,y));
}
int querysum(int k,int l,int r,int x,int y)
{
    if (l>r||x>y) return 0;
    if(x==l&&y==r)return t[k].sum;
    int mid=(l+r)>>1;
    if(y<=mid)return querysum(k<<1,l,mid,x,y);
    else if(x>mid)return querysum(k<<1|1,mid+1,r,x,y);
    else return querysum(k<<1,l,mid,x,mid)+querysum(k<<1|1,mid+1,r,mid+1,y);
}
int front,ss[maxn];
int getpos(int x)
{
    if(x<ss[1])return ss[1];
    if(x>ss[n])return ss[n];
    return ss[lower_bound(ss,ss+n+1,x)-ss];
}
int get(int x)
{
    if(x<ss[1])return 1;
    if(x>ss[n])return n;
    return lower_bound(ss,ss+n+1,x)-ss;
}
int main()
{
  scanf("%d",&n);
  c[1]=1;
  for (int i=1;i<=n;i++){
      int x,y;
      scanf("%d",&x);
      scanf("%d",&a[i]);
      if (i!=1 && x-front==1) c[i]=1;
      ss[i]=x;
      front=x;
  }
  ss[++n]=2e9; ss[0]=-2e9;
  build(1,1,n);
  scanf("%d",&m);
  for (int i=1;i<=m;i++){
     int x,y;
     x=read(),y=read();
     if (x!=getpos(x) && y!=getpos(y)){
        printf("maybe\n");
        continue;
     }
     if (x!=getpos(x)){
       x=getpos(x);
       int a1=querymax(1,1,n,get(x),get(y)-1);
       int cnt = a[get(y)];
       if (a1>=cnt) printf("false\n");
       else printf("maybe\n");
       continue;
    }
    if (y!=getpos(y)){
       if (y>ss[n]) y=ss[n];
       else y=ss[lower_bound(ss,ss+1+n,y)-ss-1];
       int a1=querymax(1,1,n,get(x)+1,lower_bound(ss,ss+1+n,y)-ss);
       int cnt = a[get(x)];
       if (a1>=cnt) printf("false\n");
       else printf("maybe\n");
       continue;
    }
    int l=get(x)+1,r=get(y);
    int cnt = a[get(y)];
    int cnt1=a[get(x)];
    int a1=querymax(1,1,n,l,r-1);
    int a3=querysum(1,1,n,l,get(y));
    if (a1>=cnt || cnt>cnt1) printf("false\n");
    else if (a1<cnt && r-l+1==a3 && cnt<=cnt1) printf("true\n");
    else printf("maybe\n");
  }
  return 0;
}