제출 #1267259

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1267259		ngunguoi45	학생 (COCI14_studentsko)	C++17	100 / 100	33 ms	328 KiB

studentsko

#include <bits/stdc++.h>

using namespace std;
using pii = pair<int,int>;

const int maxn = 5005;

int n, k;
int a[maxn];
int dp[maxn];
int id[maxn];
pii b[maxn];

void read_prep_solve () {
    cin >> n >> k;
    for (int i = 1;i <= n; i++) {
        dp[i] = 1;
        cin >> a[i];
        b[i].first = a[i];
        b[i].second = i;
     }
    sort (b+1, b+n+1);
    for (int i = 1;i <= n; i++) {
        id[b[i].second] = (i+k-1)/k;
    }
    for (int i = 1;i <= n; i++) {
        for (int j = 1;j < i; j++) {
            if (id[j] <= id[i]) {
                dp[i] = max (dp[i], dp[j] + 1);
            }
        }
    }
    for (int i = 1;i <= n; i++) dp[i] = max (dp[i], dp[i-1]);
    cout << n - dp[n] << "\n";
}

int main () {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    read_prep_solve();

    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