Submission #383157

#	Time	Username	Problem	Language	Result	Execution time	Memory
383157		vulpes	Studentsko (COCI14_studentsko)	C++17	100 / 100	46 ms	748 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;

const int N = 5002;
int a[N], b[N], d[N];
map<int,int> m;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int n, k; cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i]; b[i] = a[i];
    }
    sort(b + 1, b + n + 1);
    for (int i = 1; i <= n; i++) {
        m[b[i]] = (i - 1) / k;
    }
    for (int i = 1; i <= n; i++) {
        a[i] = m[a[i]];
    }
    int mx = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j; j--) {
            if (a[i] >= a[j]) {
                d[i] = max(d[i], d[j] + 1);
            }
        }
        mx = max(mx, d[i]);
    }
    cout << n - mx << endl;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10