#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int a[N];
int t,n;
void solve()
{
	cin>>n;
	ll sum = 0;
	for(int i = 1;i <= n;i++)
	{
		cin>>a[i];
	}
	vector<int>s(1);
	s.push_back(1); 
	a[0] = 0x3f3f3f;
	for(int i = 1;i <= n;i++)
	{
		while(a[s.back()] < a[i]) s.pop_back();
		sum += i - s.back() - 1;
		s.push_back(i);
	}
	
	s.clear();
	s.push_back(n);
	a[n+1] = 0x3f3f3f;
	for(int i = n ;i >= 1;i--)
	{
		while(a[s.back()] < a[i]) s.pop_back();
		if(a[s.back()] != a[i]) sum += s.back() - i - 1;
		s.push_back(i); 
	}
	cout<<sum<<endl;
}
int main()
{
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
}