# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062111 | dpsaveslives | Rabbit Carrot (LMIO19_triusis) | C++17 | 22 ms | 4308 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;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int N,M; cin >> N >> M;
vector<int> arr(N);
for(int i = 0;i<N;++i){
cin >> arr[i];
}
reverse(arr.begin(),arr.end());
vector<int> dp;
for(int i = 0;i<N;++i){
int ind = N-i;
if(arr[i] > M*ind) continue;
int it = upper_bound(dp.begin(),dp.end(),arr[i]-M*ind)-dp.begin();
if(it == dp.size()){
dp.push_back(arr[i]-M*ind);
}
else{
dp[it] = arr[i]-M*ind;
}
}
cout << N-dp.size() << "\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... |