Codeforces Round #361 (Div. 2) D. Friends and Subsequences

原题链接

D. Friends and Subsequences

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Mike and !Mike are old childhood rivals, they are opposite in everything they do, except programming. Today they have a problem they cannot solve on their own, but together (with you) — who knows?

Every one of them has an integer sequences a and b of length n. Being given a query of the form of pair of integers (l, r), Mike can instantly tell the value of  while !Mike can instantly tell the value of .

Now suppose a robot (you!) asks them all possible different queries of pairs of integers (l, r) (1 ≤ l ≤ r ≤ n) (so he will make exactlyn(n + 1) / 2 queries) and counts how many times their answers coincide, thus for how many pairs  is satisfied.

How many occasions will the robot count?

Input

The first line contains only integer n (1 ≤ n ≤ 200 000).

The second line contains n integer numbers a1, a2, ..., an ( - 109 ≤ ai ≤ 109) — the sequence a.

The third line contains n integer numbers b1, b2, ..., bn ( - 109 ≤ bi ≤ 109) — the sequence b.

Output

Print the only integer number — the number of occasions the robot will count, thus for how many pairs  is satisfied.

Examples

input

6
1 2 3 2 1 4
6 7 1 2 3 2

output

2

input

3
3 3 3
1 1 1

output

0

Note

The occasions in the first sample case are:

1.l = 4,r = 4 since max{2} = min{2}.

2.l = 4,r = 5 since max{2, 1} = min{2, 3}.

There are no occasions in the second sample case since Mike will answer 3 to any query pair, but !Mike will always answer 1.

先用ST算法预处理。然后遍历数组,用二分分别求出包含第i个数的区间有多少个。

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int d1[200005][20], d2[200005][20];
int getMax(int l, int r){
	int h = 0;
	while(1<<(h+1) <= r-l+1)h++;
	return max(d1[l][h], d1[r-(1<<h)+1][h]);
}
int getMin(int l, int r){
	int h = 0;
	while(1<<(h+1) <= r-l+1)h++;
	return min(d2[l][h], d2[r-(1<<h)+1][h]);
}
int main(){
	
//	freopen("in.txt", "r", stdin);
	int n;
	
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
		scanf("%d", d1[i]);
	for(int i = 0; i < n; i++)
	   scanf("%d", d2[i]);
	for(int i = 1; (1<<i) <= n; i++)
	   for(int j = 0; j+(1<<i) <= n; j++){
	   	d1[j][i] = max(d1[j][i-1], d1[j+(1<<(i-1))][i-1]);
	   	d2[j][i] = min(d2[j][i-1], d2[j+(1<<(i-1))][i-1]);
	   }
	ll ans = 0;
	for(int i = 0; i < n; i++){
		
		int l = i, r = n;
		while(l < r){
			
			int mid = (l + r) >> 1;
			if(getMax(i, mid) >= getMin(i, mid))
			  r = mid;
			else
			  l = mid + 1;
		}
		if(getMax(i, r) != getMin(i, l))
		  continue;
		int p = l;
		l = i, r = n;
		while(l < r){
			int mid = (l + r) >> 1;
			if(getMax(i, mid) > getMin(i, mid))
			  r = mid;
			else
			  l = mid + 1; 
		}
		ans += l - p;
    }
    printf("%I64d\n", ans);
    return 0;
}