#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const ll mxn = 1e6+10;
int N;
map<int,int> mp;
int arr[mxn];
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N;
for(int i = 1;i<=N;i++)cin>>arr[i];
for(int i = 1;i<=N;i++){
if(mp.find(arr[i]) != mp.end()){
mp[arr[i]]--;
if(!mp[arr[i]])mp.erase(arr[i]);
}
mp[arr[i]-1]++;
}
ll ans = 0;
for(auto &i:mp)ans += i.sc;
cout<<ans<<'\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
488 KB |
Output is correct |
4 |
Correct |
2 ms |
348 KB |
Output is correct |
5 |
Correct |
262 ms |
7176 KB |
Output is correct |
6 |
Correct |
232 ms |
7548 KB |
Output is correct |
7 |
Correct |
169 ms |
6184 KB |
Output is correct |
8 |
Correct |
172 ms |
5968 KB |
Output is correct |
9 |
Correct |
222 ms |
6692 KB |
Output is correct |
10 |
Correct |
202 ms |
6740 KB |
Output is correct |