Submission #578292

#TimeUsernameProblemLanguageResultExecution timeMemory
578292Trisanu_DasStudentsko (COCI14_studentsko)C++17
100 / 100
45 ms468 KiB
#include <bits/stdc++.h> using namespace std; #define pii pair<int, int> int main() { int N, K; cin >> N >> K; vector<pii> a; vector<int> tb; 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); } cout << N - ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...