#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ar array
#define vo vector
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()
#define rep(i, a, b) for(ll i=a; i<b; i++)
#define repd(i, a, b) for(ll i=a; i>=b; i--)
int main() {
cin.tie(0)->sync_with_stdio(0);
ll n;
cin >> n;
ll h[ll(1e6)+1];
memset(h, 0, sizeof h);
vo<ll> A(n);
rep(i, 0, n)
cin >> A[i];
repd(i, n-1, 0) {
ll a=A[i];
if(h[a-1])
h[a-1]--;
h[a]++;
}
ll ans=0;
rep(i, 0, ll(1e6+1))
ans+=h[i];
cout << ans << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
8128 KB |
Output is correct |
2 |
Correct |
5 ms |
8144 KB |
Output is correct |
3 |
Correct |
5 ms |
8144 KB |
Output is correct |
4 |
Correct |
5 ms |
8192 KB |
Output is correct |
5 |
Correct |
60 ms |
17888 KB |
Output is correct |
6 |
Correct |
62 ms |
18520 KB |
Output is correct |
7 |
Correct |
49 ms |
16668 KB |
Output is correct |
8 |
Correct |
47 ms |
16584 KB |
Output is correct |
9 |
Correct |
54 ms |
17236 KB |
Output is correct |
10 |
Correct |
52 ms |
17408 KB |
Output is correct |