# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1019395 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 1 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 <bits/stdc++.h>
using namespace std;
int m,n,x=0;
int main() {
cin >> n >> m;
int a[n+1],b[n+1];
for(int i =1; i <= n; i++){
cin >> a[i];
b[i]=a[i]-(m*i)-m;
}
vector<int>dp(n+2,2e9+50);
int lis=1;
for(int i=0;i<=n+1;i++)
{
int pos=upper_bound(dp.begin(),dp.end(),-(a[i]-i*m))-dp.begin();
if(pos!=0 or i==0)dp[pos]=-(a[i]-i*m);
lis=pos+1;
}
cout<<n-(lis-2)<<"\n";
}
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... |