#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"
const int N = 1e6;
int a[1 + N];
vector <int> pos[1 + N];
int in_use[1 + N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pos[a[i]].pb (i);
}
int ans = 0;
priority_queue <int> pq;
for (int i = 1; i <= N; i++) {
for (auto x : pos[i]) {
if (in_use[x] == 0) {
in_use[x] = 1;
ans++;
}
if (x + 1 <= n && !in_use[x + 1])
in_use[x + 1] = 1;
}
}
cout << ans << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
23800 KB |
Output is correct |
2 |
Incorrect |
27 ms |
23800 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
23800 KB |
Output is correct |
2 |
Incorrect |
27 ms |
23800 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
23800 KB |
Output is correct |
2 |
Incorrect |
27 ms |
23800 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
23800 KB |
Output is correct |
2 |
Incorrect |
27 ms |
23800 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |