#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6+5;
int main(){
ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
int heights[MAXN];
memset(heights, 0, sizeof(heights));
int n; cin >> n;
int cnt=0;
for (int i=0; i<n; i++){
int x;
cin >> x;
if (heights[x]) heights[x]--;
else cnt++;
heights[x-1]++;
}
cout << cnt;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4224 KB |
Output is correct |
2 |
Correct |
7 ms |
4224 KB |
Output is correct |
3 |
Correct |
7 ms |
4224 KB |
Output is correct |
4 |
Correct |
7 ms |
4224 KB |
Output is correct |
5 |
Correct |
76 ms |
4224 KB |
Output is correct |
6 |
Correct |
78 ms |
4224 KB |
Output is correct |
7 |
Correct |
64 ms |
4352 KB |
Output is correct |
8 |
Correct |
63 ms |
4224 KB |
Output is correct |
9 |
Correct |
71 ms |
4224 KB |
Output is correct |
10 |
Correct |
67 ms |
4224 KB |
Output is correct |