#include <bits/stdc++.h>
#define sze(x) (ll)x.size()
#define idx(x, a) get<x>(a)
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
const ll MAXN = 1e6 + 3;
const ll INF = 1e18 + 7;
ll a[MAXN], n, res = 0;
bitset<MAXN> here, need;
int main()
{
ios_base::sync_with_stdio(0); cout.tie(0);
#ifdef OFFLINE
freopen("input.inp", "r", stdin);
#endif
cin >> n;
for (ll i = 0; i < n; ++i) cin >> a[i];
for (ll i = n - 1; i >= 0; --i)
{
if (here[a[i] - 1]) here[a[i] - 1] = 0;
else ++res;
here[a[i]] = 1;
}
cout << res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
5 |
Incorrect |
78 ms |
10052 KB |
Output isn't correct |
6 |
Incorrect |
82 ms |
10768 KB |
Output isn't correct |
7 |
Incorrect |
66 ms |
8804 KB |
Output isn't correct |
8 |
Incorrect |
66 ms |
8776 KB |
Output isn't correct |
9 |
Incorrect |
74 ms |
9488 KB |
Output isn't correct |
10 |
Incorrect |
73 ms |
9608 KB |
Output isn't correct |