Submission #67785945

---

Source Code Expand

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

#define mp make_pair
#define all(x) x.begin(), x.end()
#define x first
#define y second

void solve() { 
    
    int n;
    cin >> n;

    vector<ll> A(n);
    for(auto& i : A) cin >> i;

    ll ans = 0;
    stack<int> st;

    for(auto f : A){
        vector<int> tmp;
        while(!st.empty() && st.top() < f){
            tmp.push_back(st.top()); st.pop();
        }
        
        if (!tmp.empty()){
            ans += f - tmp[0] - (int)tmp.size() + 1;
            int tval = f;
            while(!st.empty() && st.top() == tval){
                st.pop();
                tval++;
            }
            st.push(tval);
        }

        int val = f;
        while(!st.empty() && st.top() == val){
            st.pop();
            val++;
        }
        st.push(val);
    }

    vector<ll> tmp;
    while(!st.empty()) {
        tmp.push_back(st.top()); st.pop();
    }

    ans += tmp.back() - tmp[0];
    if ((int)tmp.size() >= 2){
        ans -= (int)tmp.size() - 2;
    }
    cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result