Submission #1111848

#TimeUsernameProblemLanguageResultExecution timeMemory
1111848PwoStudentsko (COCI14_studentsko)C++17
100 / 100
26 ms800 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int32_t main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; int a[n], cpy[n]; for (int i = 0; i < n; i++) { cin >> a[i]; cpy[i] = a[i]; } sort(cpy, cpy + n); map<int, int> mp; for (int i = 0; i < n; i++) mp[cpy[i]] = i / k; for (int i = 0; i < n; i++) a[i] = mp[a[i]]; int ans = 1; int dp[n]{}; dp[0] = 1; for (int i = 1; i < n; i++) { int mx = 0; for (int j = 0; j < i; j++) if (a[j] <= a[i]) mx = max(mx, dp[j]); dp[i] = mx + 1; ans = max(ans, dp[i]); } cout << n - ans; }
#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...