Submission #462592

#	Time	Username	Problem	Language	Result	Execution time	Memory
462592		JasperL	Studentsko (COCI14_studentsko)	C++14	100 / 100	49 ms	484 KiB

studentsko

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define maxn 5005

int n,k;
vector<pair<int,int>> v;
int a[maxn], dp[maxn];

int main() {
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        int x; cin >> x;
        v.push_back({x,i});
    }
    sort(v.begin(),v.end());
    for (int i = 0; i < n; i++) {
        a[v[i].second] = i / k;
    }
    int lis = 0;
    for (int i = 0; i < n; i++) {
        dp[i] = 1;
        for (int j = 0; j < i; j++) {
            if (a[j] <= a[i]) {
                dp[i] = max(dp[i],1+dp[j]);
            }
        }
        lis = max(lis,dp[i]);
    }
    cout << n - lis << endl;
}

• 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