Submission #320280

#	Time	Username	Problem	Language	Result	Execution time	Memory
320280		kaplanbar	Studentsko (COCI14_studentsko)	C++14	100 / 100	43 ms	748 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 5005;
int n, k, a[N], dp[N];
map<int,int> mp;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    for(int i = 0; i < n; i++) {
        int x;
        cin >> x;
        mp[x] = i;
    }
    int c = 0;
    for(auto x : mp) {
        a[x.second] = c / k;
        c++;
    }
    int ans = 0;
    for(int i = 0; i < n; i++) {
        dp[i] = 1;
        for(int j = i - 1; j >= 0; j--) {
            if(a[j] <= a[i]) dp[i] = max(dp[i], dp[j] + 1);
        }
        ans = max(ans, dp[i]);
    }
    cout << n - ans;
    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