Submission #94463

#TimeUsernameProblemLanguageResultExecution timeMemory
94463AntonioDakiBaloni (COCI15_baloni)C++14
40 / 100
2073 ms10872 KiB
#include<bits/stdc++.h> using namespace std; long long h[1000002]; int main() { ios::sync_with_stdio(0); cin.tie(0); long long n, h1, x = 0; cin >> n; for(long long i = 0; i < n; ++i) cin >> h[i]; for(long long i = 0; i < n; ++i){ h1 = h[i]; if(h1 != -1){ ++x; for(long long j = 0; j < n; ++j){ if(h1 == h[j]){ h[j] = -1; --h1; } if(!h1) j = n; } } if(*max_element(h, h + n) == -1){ cout << x; return 0; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...