r9qRuk - Online C++ Compiler & Debugging Tool

// بسم الله الرحمن الرحيم

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

template<typename T> ostream& operator<<(ostream& os, vector<T>& v) { for (auto& i : v) os << i << ' '; return os; }
template<typename T> istream& operator>>(istream& is, vector<T>& v) { for (auto& i : v) is >> i; return is; }

#define FreePalestine  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)

#define endl     '\n'
#define int      long long
#define ull      unsigned long long
#define vi       vector<int>
#define vvi      vector<vi>
#define pi       pair<int, int>
#define all(a)   a.begin(), a.end()
#define all_r(a) a.rbegin(), a.rend()

const int N = 302, oo = 2e18, MOD = 1e9+7;
int n, a[N], dp[N][N][N];

int ans(int i = 0, int mx = 0, int mx_2 = 0) {
    if (i >= n)
        return 1;


    int& ret = dp[i][mx][mx_2];

    if (~ret)
        return ret;

    ret = 0;

    ret += ans(i+1, mx, mx_2);
    if (ret >= MOD)
        ret -= MOD;

    if (a[i] >= mx_2) {
        if (a[i] > mx) {
            mx_2 = mx;
            mx = a[i];
        }
        else if (a[i] != mx && a[i] > mx_2) {
            mx_2 = a[i];
        }
        ret += ans(i+1, mx, mx_2);

        if (ret >= MOD)
            ret -= MOD;

    }

    return ret;
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    memset(dp, -1, sizeof dp);

    cout << ans() << endl;
}


signed main() {
   FreePalestine;
   // #ifndef ONLINE_JUDGE
   //    freopen("input.txt", "r", stdin);
   //    freopen("output.txt", "w", stdout);
   // #endif
   int t; t = 1;
   cin >> t;
   while (t--) solve();
   return 0;
}