题意
给两个长度相同的整型数组a[],b[], 找到所有的l到r,使得l到r内的 a_max 与 b_min相同,输出满足条件的组数。
题解
稀疏表+二分搜索
稀疏表:
用da[i][j] 表示 数组a从第i个元素开始,到第 (i + 2^j -1) 个元素中的最大数
同理db[i][j] 表示数组b中从第i个元素开始,到第 (i + 2^j -1) 个元素中的最小数递推的过程同dp:
da[i][j] = max(da[i][j-1], da[i+(1<<(j-1))][j-1]);
db[i][j] = min(db[i][j-1], db[i+(1<<(j-1))][j-1]);
求一段区间 [x,y] 的最大最小值时:
a_max= max(da[x][t], da[y-(1<<(j))+1][t]);
b_min = min(db[x][t], db[y-(1<<(j))+1][t]);二分:
将从1到n分别作为l, 通过二分搜索求出(a_max == b_min)的边界,进而得到总结果
代码
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<queue>
#define INF 0x3fffffff
using namespace std;
typedef long long ll;
const int MAX_N = 2e5+10;
int a[MAX_N];
int b[MAX_N];
int da[MAX_N][21];
int db[MAX_N][21];
void dodd(int n)
{
int k = (int)(log(n)/log(2)) + 1;
for(int j=1;j<=k;j++)
{
for(int i=1;i+(1<<j)-1<=n;i++)
{
da[i][j] = max(da[i][j-1], da[i+(1<<(j-1))][j-1]);
db[i][j] = min(db[i][j-1], db[i+(1<<(j-1))][j-1]);
}
}
}
int query1(int x,int y)
{
int t = (int)(log(y-x+1)/log(2));
int q = da[x][t];
int p = da[y-(1<<t)+1][t];
return max(p,q);
}
int query2(int x,int y)
{
int t = (int)(log(y-x+1)/log(2));
int q = db[x][t];
int p = db[y-(1<<t)+1][t];
return min(p,q);
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
for(int i=1;i<=n;i++)
{
scanf("%d",&da[i][0]);
}
for(int i=1;i<=n;i++)
{
scanf("%d",&db[i][0]);
}
dodd(n);
ll num=0;
for(int i=1;i<=n;i++)
{
int l=i-1;
int r=n+1;
int mid;
while(r-l>1)
{
mid = (r+l)>>1;
int maxa = query1(i,mid);
int minb = query2(i,mid);
if(maxa>=minb)
{
r=mid;
}
else
l=mid;
}
if(r>n)
continue;
int ax = r;
l=i-1;
r=n+1;
while(r-l>1)
{
mid = (r+l)>>1;
int maxa = query1(i,mid);
int minb = query2(i,mid);
if(maxa>minb)
{
r=mid;
}
else
l=mid;
}
int bx = r;
if(bx>=ax)
{
num += (ll)bx-ax;
}
}
cout<<num<<endl;
}
return 0;
}