#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

typedef pair<int, int> PII;
const int N = 200010;

int T, n, a[N];
vector<PII> b;
bool st[N];


bool cmp(const PII &aa, const PII &bb)
{
	if(aa.first == bb.first) return aa.second < bb.second;
	return aa.first < bb.first;
}


int main()
{
	cin >> T;
	while(T--)
	{
		memset(a, 0, sizeof(a));
		b.clear();
		int ans = 0;
		
		cin >> n;
		for(int i = 0; i < n; i++)
		{	
			cin >> a[i];
			b.push_back({a[i], i});
		}
		sort(b.begin(), b.end(), cmp);
		
		for(auto it : b)
		{
			int x = it.first, ver = it.second;
			if(ver == 0 && a[ver + 1] > x)
				ans++, a[ver] = a[ver + 1];
			else if(ver == (n - 1) && a[ver - 1] > x)
				ans++, a[ver] = a[ver - 1];
			else if(a[ver - 1] > x && a[ver + 1] > x)
			{
				if(a[ver - 1] < a[ver + 1])
					for(int j = ver; a[j] == x && j < n; j++)
						ans++, a[j] = a[ver - 1];
				else
					for(int j = ver; a[j] == x && j >= 0; j--)
						ans++, a[j] = a[ver + 1];
			}
			else if(a[ver - 1] > x)
				for(int j = ver; a[j] == x && j < n; j++)
					ans++, a[j] = a[ver - 1];
			else if(a[ver + 1] > x)
				for(int j = ver; a[j] == x && j >= 0; j--)
					ans++, a[j] = a[ver + 1];
		}
		
		cout << ans << endl;
	}
	return 0;
}