제출 #1335045

#제출 시각아이디문제언어결과실행 시간메모리
1335045mamabearSubset Mex (EGOI22_subsetmex)C++20
100 / 100
1 ms344 KiB
#include <iostream>
#include <vector>

using namespace std;

void solve() {
    int n;
    cin >> n;
    
    vector<long long> f(n);
    for (int i = 0; i < n; ++i) {
        cin >> f[i];
    }

    long long ops = 1; 
    long long current_need = 1; 

    for (int i = n - 1; i >= 0; --i) {
        if (current_need > f[i]) {
            long long deficit = current_need - f[i];
            ops += deficit;
            current_need += deficit; 
        }
    }

    cout << ops << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int t;
    if (cin >> t) {
        while (t--) {
            solve();
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...