against_thee_difference.cpp

//https://codeforces.com/contest/2136/problem/C

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

#define vec vector 
#define ll long long
#define all(v) (v).beign(), (v).end()
#define nl << "\n"


const ll MOD = 1e9 + 7;
const ll INF = 1e9;



void solve() {
    int n; cin >> n;
    vec<int> a(n,0);
    for (int i = 0; i < n;i++){
        cin >> a[i];
    }

    for (int i = 0;i < n;){
        int val = a[i];
        for (int j = i; j < i + val; j++){
            if (a[j] != val) {
                co
            }
        }
    }
}

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve();
    }

}