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

signed main() {
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        int op = 0;
        vector<int> dp(n);
        map<int, int> mp;
        map<int, int> kp;

        for (int i = 0; i < n; i++) {
            cin >> dp[i];
            mp[dp[i]] = i;
            kp[dp[i]] = 1;
        }

        for (auto it = mp.begin(); it != mp.end(); ++it) {
            int x = it->first;
            int y = it->second;

            // Ensure y-1 and y+1 are within bounds
            if (y > 0 && y < n - 1) {
                if (dp[y - 1] < dp[y + 1]) {
                    kp[dp[y - 1]] += kp[dp[y]];
                } else {
                    kp[dp[y + 1]] += kp[dp[y]];
                }
            }

            op += kp[dp[y]];
            // Mark the element as processed
            dp[y] = -1; // Or any value that indicates it is processed
        }

        cout << op << endl;
    }
    return 0;
}