Codeforces 689D Friends and Subsequences (RMQ+二分)

题意

求有多少对区间满足其中一个区间的最大值等于另一个区间的最小值。

思路

首先RMQ预处理出所有区间的最大值和最小值（线段树会超时。。。）
然后因为我们固定这两个区间的左端点枚举区间的右端点，因为右端点越大max越大min越小，所以是满足二分的单调性的。
所以这题的做法就是枚举左端点，二分右端点的max == min的左边界l和右边界r,即[i,l]到[i,r]的区间都是满足max等于min的，统计答案ans += r - l + 1

代码

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
using namespace std;
#define LL long long
#define Lowbit(x) ((x)&(-x))
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1|1
#define MP(a, b) make_pair(a, b)
const int INF = 0x3f3f3f3f;
const int Mod = 1000000007;
const int maxn = 200000 + 7;
const double eps = 1e-8;
const double PI = acos(-1.0);
typedef pair<int, int> pii;

int a[maxn];
int b[maxn];

struct RMQ
{
    static const int RMQ_size = maxn;
    int n;
    int MAX[RMQ_size][21];
    int MIN[RMQ_size][21];
    void init(int *a, int sz)
    {
        n = sz;
        for (int i = 0; i < n; i++)
            MAX[i][0] = MIN[i][0] = a[i];
        build_rmq();
    }
    void build_rmq()
    {
        for (int j = 1; (1 << j) <= n; j++)
            for (int i = 0; i + (1 << j) - 1 < n; i++)
            {
                MAX[i][j] = max(MAX[i][j-1], MAX[i+(1<<(j-1))][j-1]);
                MIN[i][j] = min(MIN[i][j-1], MIN[i+(1<<(j-1))][j-1]);
            }
    }
    int QueryMax(int L, int R)
    {
        int k = 0;
        while ((1 << (k + 1)) <= R - L + 1) k++;
        return max(MAX[L][k], MAX[R-(1<<k)+1][k]);
    }
    int QueryMin(int L, int R)
    {
        int k = 0;
        while ((1 << (k + 1)) <= R - L + 1) k++;
        return min(MIN[L][k], MIN[R-(1<<k)+1][k]);
    }
}s1, s2;

int main()
{
    //freopen("H:\\in.txt","r",stdin);
    //freopen("H:\\out.txt","w",stdout);
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    for (int i = 0; i < n; i++)
        scanf("%d", &b[i]);
    s1.init(a, n + 1);
    s2.init(b, n + 1);
    LL ans = 0;
    for (int i = 0; i < n; i++)
    {
        //右端点向右max越来越大,min越来越小
        int l = i, r = n - 1;
        while (l < r)     //[l,r]
        {
            int mid = (r + l) / 2;
            if (s1.QueryMax(i, mid) >= s2.QueryMin(i, mid))
                r = mid;
            else
                l = mid + 1;
        }
        if (s1.QueryMax(i, l) != s2.QueryMin(i, l)) continue;
        ans -= l;
        l = l, r = n - 1;
        while (l < r)   //[l,r]
        {
            int mid = (r + l + 1) / 2;
            if (s1.QueryMax(i, mid) > s2.QueryMin(i, mid))
                r = mid - 1;
            else
                l = mid;
        }
        ans += l + 1;
    }
    printf("%lld\n", ans);
    return 0;
}