제출 #397452

#제출 시각아이디문제언어결과실행 시간메모리
397452mewnianBaloni (COCI15_baloni)C++14
0 / 100
82 ms10768 KiB
#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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...