Manhattan Subarrays（思维）

最新推荐文章于 2023-03-30 16:13:01 发布

m0_51864047

最新推荐文章于 2023-03-30 16:13:01 发布

阅读量181

点赞数

本文链接：https://blog.csdn.net/m0_51864047/article/details/119462945

版权

数组子数组坏三元组距离计算 Manhattan距离

关键词由CSDN通过智能技术生成

Suppose you have two points $p=(x_p,y_p)$ and $q=(x_q,y_q)$ . Let’s denote the Manhattan distance between them as $d(p,q)=|x_p−x_q|+|y_p−y_q|$ .

Let’s say that three points $p, q, r$ form a bad triple if $d (p, r) = d (p, q) + d (q, r)$ .

Let’s say that an array $b_1,b_2,…,b_m$ is good if it is impossible to choose three distinct indices $i, j, k$ such that the points $b_i,i), (b_j,j)$ and $b_k,k)$ form a bad triple.

You are given an array $a_1,a_2,…,a_n$ . Calculate the number of good subarrays of $a$ . A subarray of the array a is the array $a_l,a_{l+1},…,a_r$ for some $1 \leq l \leq r \leq n$ .

Note that, according to the definition, subarrays of length $1$ and $2$ are good.

Input

The first line contains one integer $t (1 \leq t \leq 5000)$ — the number of test cases.

The first line of each test case contains one integer $n (1≤n≤2⋅10^5)$ — the length of array a.

The second line of each test case contains $n$ integers $a_1,a_2,…,a_n (1≤a_i≤10^9)$ .

It’s guaranteed that the sum of n doesn’t exceed $2⋅10^5$ .

Output
For each test case, print the number of good subarrays of array a.

Example

input

output

10
12
3

Note

In the first test case, it can be proven that any subarray of a is good. For example, subarray $a_2,a_3,a_4]$ is good since it contains only three elements and:

$d((a_2,2),(a_4,4))=|4−3|+|2−4|=3 < d((a_2,2),(a_3,3))+d((a_3,3),(a_4,4))=3+1+2+1=7$ ;
$d((a_2,2),(a_3,3)) < d((a_2,2),(a_4,4))+d((a_4,4),(a_3,3))$ ;
$d((a_3,3),(a_4,4)) < d((a_3,3),(a_2,2))+d((a_2,2),(a_4,4))$ ;

In the second test case, for example, subarray $a_1,a_2,a_3,a_4]$ is not good, since it contains a bad triple $a_1,1), (a_2,2), (a_4,4)$ :

$d((a_1,1),(a_4,4))=|6−9|+|1−4|=6$ ;
$d((a_1,1),(a_2,2))=|6−9|+|1−2|=4$ ;
$d((a_2,2),(a_4,4))=|9−9|+|2−4|=2$ ;

So, $d((a_1,1),(a_4,4))=d((a_1,1),(a_2,2))+d((a_2,2),(a_4,4))$ .

STD

转述题意：若一个数组，里面存在三个元素， $a_i,a_j,a_k$ 满足 $i < j < k$ 且 $a_i<a_j<a_k) || (a_i>a_j>a_k)$ ，则称这个数组是 “坏数组” 。现在给出一个数组，问它有多少个子数组不是 “坏数组” ，子数组是连续的。

有一个结论：任意长度大于等于 $5$ 的数组都是 “坏数组”。在这个结论之上，就很好做这道题了。由于长度为 $1$ 、 $2$ 的数组必然不是 “坏数组” 所以，我们只需判断长度为 $3$ 、 $4$ 的子数组就行了。

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+10;
int T,n,a[N];

bool calc(int a,int b,int c){
	if(a>=b&&b>=c||a<=b&&b<=c) return false;
	return true;
}

void solve(){
	cin>>n;
	int ans=(n<<1)-1;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=3;i<=n;i++)
		if(calc(a[i-2],a[i-1],a[i])) 
			ans++;
	for(int i=4;i<=n;i++)
		if(calc(a[i-3],a[i-2],a[i-1])&&calc(a[i-3],a[i-2],a[i])&&
				calc(a[i-3],a[i-1],a[i])&&calc(a[i-2],a[i-1],a[i]))
			ans++;
	cout<<ans<<"\n";
}

int main(){
	ios::sync_with_stdio(false);
	for(cin>>T;T;T--) solve();
}