# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
394749 | Qw3rTy | Rabbit Carrot (LMIO19_triusis) | C++11 | 1081 ms | 1628 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 <iostream>
using namespace std;
const int maxN = 2e5+5;
int f[maxN];
int a[maxN];
int N,M;
void testIO(){
freopen("../test.in","r",stdin);
return;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//testIO();
cin >> N >> M;
for(int i = 1; i <= N; ++i)cin >> a[i];
a[0] = 0;
f[0] = 0;
for(int i = 1; i <= N; ++i){
if(a[i] > M*i)continue;
for(int j = 0; j < i; ++j){
if(a[j] + M*(i-j) >= a[i])f[i] = max(f[i],f[j]+1);
}
}
int res = 0;
for(int i = 1; i <= N; ++i)res = max(res,f[i]);
cout << N - res << '\n';
return 0;
}
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... |