# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998038 | Petrix | Rabbit Carrot (LMIO19_triusis) | C++17 | 0 ms | 344 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;
int v[200001];
int n;
int caut(int a){
int st,dr,mij,rasp;
st=0;dr=n-1;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]>a){
rasp=mij;st=mij-1;
}else dr=mij+1;
}
return rasp;
}
int main() {
int d,max1=-1,a,i,aux;
cin>>n>>d;
for(i=0;i<=n;i++) v[i]=1e9;
for(i=1;i<=n;i++){
cin>>a;
a=i*d-a;
if(a<=0) continue;
aux=caut(a);
v[aux]=a;max1=max(max1,aux);
}
cout<<n-1-max1;
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... |