#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 5;
int n;
int h[N];
int pop[N];
set<int> pos[N];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i];
pos[h[i]].insert(i);
}
int ans = 0;
for (int i = n; i >= 1; i--) {
for (auto p : pos[i]) {
++ans;
int x = i - 1;
while (x > 0) {
auto it = pos[x].upper_bound(p);
if (it == pos[x].end()) break;
pos[x].erase(it);
x--;
}
}
}
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
22 ms |
47300 KB |
Output isn't correct |
2 |
Incorrect |
24 ms |
47288 KB |
Output isn't correct |
3 |
Incorrect |
22 ms |
47444 KB |
Output isn't correct |
4 |
Incorrect |
23 ms |
47468 KB |
Output isn't correct |
5 |
Incorrect |
559 ms |
91100 KB |
Output isn't correct |
6 |
Incorrect |
677 ms |
95928 KB |
Output isn't correct |
7 |
Incorrect |
502 ms |
87364 KB |
Output isn't correct |
8 |
Incorrect |
528 ms |
86816 KB |
Output isn't correct |
9 |
Incorrect |
528 ms |
89180 KB |
Output isn't correct |
10 |
Incorrect |
611 ms |
90768 KB |
Output isn't correct |