难点分析:首先是我们要用将区间最值用两张ST表给导出来,分别是sta[][], stb[][];之后,设变量i从1 到N 枚举区间有段点,再用二分进行夹逼,得到左右两段区间left:[r + 1, n], right:[i, l - 1];
其中left区间中任意一个数作为右端点,满足querymax >= querymin; 而 right 区间 则是querymax <= querymin; 如果区间有交集,即为l - 1 >= r + 1, answer 就加上这个交集中元素的个数,个数即为 l - (r+1);
//AC 代码:
#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<cstdlib>
#include<cmath>
#define int long long
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int sta[maxn][30];
int stb[maxn][30];
inline int read()
{
int x=0,f=1;char ch=getchar();
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;
}
void init_sta(int n){
for(int j = 1; j <= 20; j++){
for(int i = 1; i + (1 << j) - 1 <= n; i++){
sta[i][j] = max(sta[i][j - 1], sta[i + (1<<(j - 1))][j - 1]);
}
}
}
void init_stb(int n){
for(int j = 1; j <= 20; j++){
for(int i = 1; i + (1 << j) - 1 <= n; i++){
stb[i][j] = min(stb[i][j - 1], stb[i + (1<<(j - 1))][j - 1]);
}
}
}
int querymax(int l, int r){
int k = (int)log2(r - l + 1);
int a = sta[l][k];
int b = sta[r - (1<<k) + 1][k];
return max(a, b);
}
int querymin(int l, int r){
int k = (int)log2(r - l + 1);
int a = stb[l][k];
int b = stb[r - (1<<k) + 1][k];
return min(a, b);
}
int binary_search_right(int k, int l, int r){
while(l <= r){
int mid = (l + r)/2;
int x = querymax(k, mid);
int y = querymin(k, mid);
if(y < x){
r = mid - 1;
}else{
l = mid + 1;
}
}
return l;
}
int binary_search_left(int k, int l, int r){
while(l <= r){
int mid = (l + r)/2;
int x = querymax(k, mid);
int y = querymin(k, mid);
if(y > x){
l = mid + 1;
}else{
r = mid - 1;
}
}
return r;
}
signed main(){
int n, m;
n = read();
for(int i = 1; i <= n; i++){
sta[i][0] = read();
}
for(int i = 1; i <= n; i++){
stb[i][0] = read();
}
init_sta(n);
init_stb(n);
int ans = 0;
for(int i = 1; i <= n; i++){
int l = i;
int r = n;
int left = binary_search_left(i, l, r);
int right = binary_search_right(i, l, r);
// cout<<left<<" "<<right<<endl;
if(right - 1 >= left + 1){
ans = ans + (right - (left + 1));
}
}
cout<<ans<<endl;
return 0;
}