Submission #17499

#	Time	Username	Problem	Language	Result	Execution time	Memory
17499		kdh9949	Studentsko (COCI14_studentsko)	C++98	100 / 100	55 ms	1140 KiB

studentsko

#include <cstdio>
#include <algorithm>
using namespace std;

int n, k, a[5010], b[5010], dt[5010], ans;

int main(){
    scanf("%d%d", &n, &k);
    for(int i = 0; i < n; i++){
        scanf("%d", a + i);
        b[i] = a[i];
    }
    sort(b, b + n);
    for(int i = 0; i < n; i++){
        a[i] = (lower_bound(b, b + n, a[i]) - b) / k;
    }
    dt[0] = 1;
    for(int i = 1; i < n; i++){
        dt[i] = 1;
        for(int j = 0; j < i; j++){
            if(a[j] <= a[i]) dt[i] = max(dt[i], dt[j] + 1);
        }
    }
    for(int i = 1; i < n; i++) ans = max(ans, dt[i]);
    printf("%d", n - ans);
}

• 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