Submission #568673

#	Time	Username	Problem	Language	Result	Execution time	Memory
568673		Garguy22	Baloni (COCI15_baloni)	C++17	40 / 100	2095 ms	7260 KiB

baloni

#include <iostream>
using namespace std;

const int MAXN = 1e6 + 7;

int a[MAXN];

int main() {
    
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    int cur, ans = 0;
    for(int i = 1; i <= n; i++)
    {
        cur = a[i];
        if(a[i] == -1)
            continue;
        ans++;
        for(int j = i+1; j <= n ; j++)
        {
            if(a[j] == -1)
                continue;
            if(cur-1 == a[j])
            {
                a[j] = -1;
                cur--;
            }
        }
        a[i] = -1;
    }
    cout << ans << endl;
    
    return 0;
}

• Subtask 1: 40 / 100