#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<array>
using namespace std;
using LL = long long;

const int maxn = 1e5 + 5;
int p[maxn], l[maxn], r[maxn], a[maxn], L[maxn], R[maxn];

void init(int n){
    for(int i = 1; i <= n; i++){
        p[i] = L[i] = R[i] = i;
        l[i] = r[i] = a[i];
    }
}

int find(int x){
    return p[x] == x ? x : p[x] = find(p[x]);
}

void merge(int x, int y){
    x = find(x), y = find(y);
    if (x != y){
        p[x] = y;
        l[y] = min(l[y], l[x]);
        r[y] = max(r[y], r[x]);
        L[y] = min(L[y], L[x]);
        R[y] = max(R[y], R[x]);
    }
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    const int INF = 1e9;
    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        for(int i = 1; i <= n; i++) cin >> a[i];
        init(n);
        auto get = [&](int x, int y){
            if (find(x) == find(y)) return INF;
            if (r[find(x)] > r[find(y)]) swap(x, y);
            if (r[find(x)] < l[find(y)]) return r[find(y)] - l[find(x)];
            return INF;
        };

        int ans = 0;
        using P = array<int, 3>;
        priority_queue<P, vector<P>, greater<P> > q;
        for(int i = 1; i + 1 <= n; i++){
            int cost = get(i, i + 1);
            if (cost != INF) q.push({cost, i, i + 1});
        }
        while(!q.empty()){
            auto [cost, x, y] = q.top();
            q.pop();
            if (get(x, y) == cost){
                ans += 1;
                merge(x, y);
                if (L[find(x)] - 1 >= 1){
                    int cost = get(L[find(x)] - 1, x);
                    if (cost != INF) q.push({cost, L[find(x)] - 1, x});
                }
                if (R[find(x)] + 1 <= n){
                    int cost = get(R[find(x)] + 1, x);
                    if (cost != INF) q.push({cost, R[find(x)] + 1, x});
                }
            }
        }
        cout << ans << '\n';
    }

}