# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
739772 | Dead_Inside7 | Rabbit Carrot (LMIO19_triusis) | C++17 | 82 ms | 5276 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 lis(vector<int>&b){
vector<int> dp;
for(auto it:b){
int x = upper_bound(dp.begin(),dp.end(),it) - dp.begin();
if(x==dp.size()) dp.push_back(it);
else dp[x]=it;
}
return dp.size();
}
int main() {
int n,k;cin>>n>>k;
vector<int> arr(n);
for(auto&v:arr) cin>>v;
vector<int> b;
for(int j=1;j<=n;j++){
int x = ((k*j) - arr[j-1]);
if(x>=0) b.push_back(x);
}
cout<<n-lis(b)<<endl;
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... |