GTY‘s gay friends （ 线段树 + 区间排列）

HDU5172

#include<bits/stdc++.h>
#define LL long long
using namespace  std;
const int maxn=1e6+5;
inline int read() {
	int s = 0, f = 1;
	char  ch = getchar();
	while (ch < '0' || ch > '9') {if (ch == '-') f = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = (s << 1) + (s << 3) + ch - '0'; ch = getchar();}
	return s * f;
}
inline void write(LL x) {
	if (x < 0) putchar('-'), x = -x;
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
struct node{
    int l,r,Max,Min;
}seg[maxn<<2];
int a[maxn],pre[maxn];
LL sum[maxn];
void build(int l,int r,int rt){
    seg[rt].l=l;seg[rt].r=r;
    if(l==r) {
        seg[rt].Max=a[l];
        return ;
    }
    int mid=(l+r)>>1;
    build(l,mid,rt<<1);
    build(mid+1,r,rt<<1|1);
    seg[rt].Max=max(seg[rt<<1].Max,seg[rt<<1|1].Max);
}
int querymax(int L,int R,int rt){
    if(L<=seg[rt].l&&R>=seg[rt].r) return seg[rt].Max;
    int mid=(seg[rt].l+seg[rt].r)>>1;
    int ans=0;
    if(L<=mid) ans=max(ans,querymax(L,R,rt<<1));
    if(R>mid) ans=max(ans,querymax(L,R,rt<<1|1));
    return ans;
}
int main(){
    int n,m,l,r;
    while(scanf("%d%d",&n,&m)!=EOF){
        for(int i=1;i<=n;i++) pre[i]=0;
        for(int i=1,j;i<=n;i++) {
            j=read();
            sum[i]=sum[i-1]+j;
            a[i]=pre[j];
            pre[j]=i;
        }
        build(1,n,1);
        for(int i=1;i<=m;i++){
            l=read();r=read();
            if(sum[r]-sum[l-1]==1LL*(r-l+2)*(r-l+1)/2&&querymax(l,r,1)<l) puts("YES");
            else puts("NO");
        }
    }
    return 0;
}