#include <bits/stdc++.h>
#define int long long
using namespace std;

void solve() {
    int n; cin >> n;
    vector<int> a(n + 2);
    a[0] = -1; // 设置哨兵
    a[n + 1] = -1; // 设置哨兵
    for(int i = 1; i <= n; i++) cin >> a[i];

    set<int> unique_values(a.begin() + 1, a.begin() + n + 1);
    unique_values.erase(*unique_values.rbegin()); // 去除最大值

    vector<pair<int, int>> segments;
    int count = 1;
    for(int i = 2; i <= n + 1; i++) {
        if(a[i] == a[i - 1]) {
            count++;
        } else {
            segments.emplace_back(a[i - 1], count);
            count = 1;
        }
    }

    map<int, vector<int>> value_positions;
    for(int i = 0; i < segments.size(); i++) {
        value_positions[segments[i].first].push_back(i);
    }

    int ans = 0;
    for(auto val : unique_values) {
        for(auto idx : value_positions[val]) {
            if(segments[idx].first == -1) continue; // 已经合并过
            ans += segments[idx].second;
            int left = idx - 1;
            int right = idx + 1;

            if(left >= 0 && right < segments.size()) {
                if(segments[left].first < segments[right].first) {
                    segments[right].second += segments[idx].second;
                } else {
                    segments[left].second += segments[idx].second;
                }
            } else if(left >= 0) {
                segments[left].second += segments[idx].second;
            } else if(right < segments.size()) {
                segments[right].second += segments[idx].second;
            }
            segments[idx].first = -1; // 标记为已合并
        }
    }

    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    cin >> tt;
    while(tt--) solve();
}