Submission #568686

#	Time	Username	Problem	Language	Result	Execution time	Memory
568686		Garguy22	Baloni (COCI15_baloni)	C++17	0 / 100	204 ms	3704 KiB

baloni

#include <iostream>
using namespace std;

const int MAXN = 1e6 + 7;

int a[MAXN], f[MAXN];

int main() {
    
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    int ans = 0;
    for(int i = n; i > 0; i--){
        f[a[i]]++;
        if(f[a[i]-1] == 1)
            f[a[i]-1]--;
        else
            ans++;
    }
    cout << ans << endl;

    return 0;
}

• Subtask 1: 0 / 100