Submission #1345524

#TimeUsernameProblemLanguageResultExecution timeMemory
1345524mxhrvsSubset Mex (EGOI22_subsetmex)C++20
0 / 100
1 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        int  a[n+1];
        for(int i = 0; i < n; i ++){
            cin >> a[i];
        }
        int ans = 1;
        for(int i = n - 1; i >= 0; i --){
            ans += max(ans - a[i],0);
        }
        cout << ans << "\n";
    }
}
#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...