# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259211 | Molukhyyeh | Studentsko (COCI14_studentsko) | C++14 | 393 ms | 49656 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(),x.end()
int const N = 5001;
int n, k, v[N];
short dp[N][N];
pair<int,int> a[N];
short go(int i, int j){
if(i == (n+1))return 0;
short &ret = dp[i][j];
if(~ret)return ret;
ret = go(i+1, j);
if(v[i] >= v[j])ret = max((short)(go(i+1, i)+1), ret);
return ret;
}
int main(){
scanf("%d%d", &n, &k);
for(int i = 1; i<=n; ++i){
scanf("%d", v+i);
a[i] = {v[i], i};
}
sort(a, a+(n+1));
int c = 1, ct = 0;
for(int i = 1; i<=n; ++i){
v[a[i].second] = c;
++ct;
if(ct == k)ct = 0, ++c;
}
memset(dp, -1, sizeof dp);
int an = go(1, 0);
printf("%d\n", n-an);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |