1882A - Increasing Sequence - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD (1e9+7)

void solve()
{
    int n;
    cin>>n;
    vector<int> a(n);
    vector<int> b(n);
    for(auto &e: a) cin>>e;
    int cnt = 1;
    for(int i = 0; i<n; i++) {
      if(cnt==a[i]) cnt++;
      b[i] = cnt;
      cnt++;
    }
    cout<<b[n-1]<<endl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

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