Submission #10709

#	Time	Username	Problem	Language	Result	Execution time	Memory
10709		tncks0121	Studentsko (COCI14_studentsko)	C++14	100 / 100	56 ms	1836 KiB

studentsko

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;

vector<pii> a;
vector<int> tb;

int N, K;

int main() {
  cin >> N >> K;
  for(int i = 0; i < N; i++) {
    int x; cin >> x;
    a.push_back(pii(x, i));
  }
  sort(a.begin(), a.end());
  
  
  vector<int> pos(N);
  for(int i = 0; i < N; i++) {
    pos[a[i].second] = i / K;
  }
  
  int ans = 0;
  for(int i = 0; i < N; i++) {
    int opt = 0;
    for(int j = 0; j < i; j++) if(pos[j] <= pos[i]) opt = max(opt, tb[j]);
    tb.push_back(opt + 1);
    ans = max(opt+1, ans);
  }
  
  printf("%d", 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