#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int MX = 1e6+5;
void solve() {
int N;
cin >> N;
vector<int> cnt(MX);
int ans = 0;
for(int i = 0; i < N; i++) {
int x;
cin >> x;
if(cnt[x] == 0) {
ans++;
cnt[x]++;
}
cnt[x]--;
cnt[x-1]++;
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
1 ms |
4184 KB |
Output is correct |
3 |
Correct |
1 ms |
4184 KB |
Output is correct |
4 |
Correct |
2 ms |
4184 KB |
Output is correct |
5 |
Correct |
42 ms |
7760 KB |
Output is correct |
6 |
Correct |
44 ms |
7760 KB |
Output is correct |
7 |
Correct |
36 ms |
6992 KB |
Output is correct |
8 |
Correct |
42 ms |
7504 KB |
Output is correct |
9 |
Correct |
40 ms |
7508 KB |
Output is correct |
10 |
Correct |
39 ms |
7504 KB |
Output is correct |