# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437055 | Autron | Rabbit Carrot (LMIO19_triusis) | C++14 | 102 ms | 4156 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(){
int n, m;
cin>>n>>m;
vector<int> v(n+1);
for(int i=1;i<=n;++i){
cin>>v[i];
v[i]*=-1;
v[i]+=m*i;
}
vector<int> lis;
for(int i=1;i<=n;++i){
if(v[i]<0) continue;
int poz=lower_bound(lis.begin(), lis.end(), v[i]+1)-lis.begin();
if(poz==lis.size()) lis.push_back(v[i]);
else lis[poz]=v[i];
}
cout<<n-lis.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... |