#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(998244353)
using namespace std;
template<class T1, class T2>
bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2>
bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2>
void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}
template<class T1, class T2>
void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}
template<class T>
void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
void solve(){
int n; cin >> n;
vector<int> a(n + 3, 0);
vector<vector<int>> pos((int)1e6 + 10);
for(int i=1; i<=n; i++){
cin >> a[i];
pos[a[i]].push_back(i);
}
int ans = n;
for(int i=n; i>=1; i--){
if(sz(pos[a[i] + 1]) > 0){
pos[a[i] + 1].pop_back();
ans--;
}
if(sz(pos[a[i]]) && pos[a[i]].back() == i) pos[a[i]].pop_back();
}
cout << ans << '\n';
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("flowers.inp", "r", stdin);
// freopen("flowers.out", "w", stdout);
int nTest = 1;
// cin >> nTest;
while(nTest--)
solve();
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
23900 KB |
Output is correct |
| 2 |
Correct |
13 ms |
23796 KB |
Output is correct |
| 3 |
Correct |
11 ms |
23896 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23900 KB |
Output is correct |
| 5 |
Correct |
64 ms |
35400 KB |
Output is correct |
| 6 |
Correct |
66 ms |
35408 KB |
Output is correct |
| 7 |
Correct |
50 ms |
34896 KB |
Output is correct |
| 8 |
Correct |
46 ms |
33108 KB |
Output is correct |
| 9 |
Correct |
52 ms |
35408 KB |
Output is correct |
| 10 |
Correct |
53 ms |
34540 KB |
Output is correct |
