Pancake Deque

#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#define MAX_N 2020
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;


ll solve(vll& A) {
    ll mi = INT_MIN, l = 0, r = A.size() - 1, res = 0;
    while(l <= r) {
        if(A[l] <= A[r]) {
            if(mi <= A[l]) res++;
            mi = max(mi, A[l++]);
        } else {
            if(mi <= A[r]) res++;
            mi = max(mi, A[r--]);
        }
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(6);
    ll tc, n;
    cin>>tc;
    for(ll i = 1; i <= tc; i++) {
        cin>>n;
        vll A(n);
        for(ll i = 0; i < n; i++) cin>>A[i];
        cout<<"Case #"<<i<<": "<<solve(A)<<'\n';
    }

    return 0;
}