# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996611 | oj123 | Rabbit Carrot (LMIO19_triusis) | C++14 | 0 ms | 348 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;
#define pb push_back
#define ll long long
#define f first
#define s second
int main() {
int n,m;
cin >> n >> m;
vector<ll> v;
v.pb(0);
for (int i=1;i<=n;i++){
ll a;
cin >> a;
v.pb((a-(m*i))*-1);
}
vector<ll> v1;
for (int i:v){
int pos=lower_bound(v1.begin(),v1.end(),i)-v1.begin();
if (pos==v1.size()){
v1.pb(i);
}else{
v1[pos]=i;
}
}
cout << endl;
cout << n-v1.size()+((v[1]<0)?1:0) << endl;
}
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... |