Submission #311757

#TimeUsernameProblemLanguageResultExecution timeMemory
311757kaplanbarBaloni (COCI15_baloni)C++14
0 / 100
83 ms131076 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 1e6+5;
int n;
queue<int> v[N];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    int mx = 0;
    for(int i = 0; i < n; i++) {
      int x;
      cin >> x;
      v[x].push(i);
      mx = max(mx, x);
    }
    int c = 0;
    for(int i = mx; i >= 1; i--) {
      if(v[i].empty()) continue;
      c++;
      int now = i;
      while(!v[now].empty()) {
        v[now].pop();
        now--;
      }
    }
    cout << c << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...