Codeforces 689D RMQ+二分

题目链接

【题意】

给定长度为n的两个序列,寻找区间l,r使得这段区间上的max(a[i]) = min (b[i]),
求满足条件的l,r数对的数量

【分析】

在固定l后，随着r的增加，max(a[i])-min(b[i])是不减的
所以可以通过二分求得max(a[i]) = min(b[i])的两个边界
具体做法就是通过RMQ维护区间最值,枚举l然后通过二分确定边界r,记录答案

【Code】

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<set>
typedef long long LL;
using namespace std;
const double PI = acos(-1.0);
const int MAX_N = 200000 + 10;
int a[MAX_N],b[MAX_N];
int mi[21][MAX_N],mx[21][MAX_N];
int t[MAX_N],p[21],n;
int get_max(int l,int r){
    int k = t[r-l+1];
    return max(mx[k][l],mx[k][r-p[k]+1]);
}
int get_min(int l,int r){
    int k = t[r-l+1];
    return min(mi[k][l],mi[k][r-p[k]+1]);
}
int lower(int p){
    int l,r,mid;
    l = p-1; r = n+1;
    while(r-l>1){
        mid = (r+l)>>1;
        if (get_max(p,mid)>=get_min(p,mid)) r = mid;
        else l = mid;
    }
    return r;
}
int upper(int p){
    int l,r,mid;
    l = p-1; r = n+1;
    while(r-l>1){
        mid = (r+l)>>1;
        if (get_max(p,mid)>get_min(p,mid)) r = mid;
        else l = mid;
    }
    return r;
}
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;i++) scanf("%d",&a[i]);
    for (int i=1;i<=n;i++) scanf("%d",&b[i]);
    p[0] = 1; t[0] = -1;
    for (int i=1;i<=20;i++) p[i] = 2*p[i-1];
    for (int i=1;i<=n;i++)
        t[i] = (i&(i-1))?t[i-1]:(t[i-1]+1);
    for (int i=1;i<=n;i++) mi[0][i] = b[i];
    for (int j=1;p[j]<=n;j++){
        for (int i=1;i+p[j]-1<=n;i++)
            mi[j][i] = min(mi[j-1][i],mi[j-1][i+p[j-1]]);
    }
     for (int i=1;i<=n;i++) mx[0][i] = a[i];
    for (int j=1;p[j]<=n;j++){
        for (int i=1;i+p[j]-1<=n;i++)
            mx[j][i] = max(mx[j-1][i],mx[j-1][i+p[j-1]]);
    }
    int l,r;
    LL ans = 0LL;
    for (int i=1;i<=n;i++){
        l = lower(i); r = upper(i);
        ans += r-l;
    }
    printf("%I64d",ans);
    return 0;
}