Submission #382138

#TimeUsernameProblemLanguageResultExecution timeMemory
382138BlancaHMBaloni (COCI15_baloni)C++14
100 / 100
454 ms7404 KiB
#include <iostream> #include <map> using namespace std; int main() { int N; cin >> N; int H[N]; for (int i = 0; i < N; i++) cin >> H[i]; map<int, int> arrows; for (int i = 0; i < N; i++) { if (arrows.find(H[i]) != arrows.end() && arrows[H[i]] > 0) arrows[H[i]]--; arrows[H[i]-1]++; } int ans = 0; for (auto it = arrows.begin(); it != arrows.end(); it++) ans += it->second; cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...