# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996612 | 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;
for (int i=0;i<n;i++){
ll a;
cin >> a;
v.pb((a-(m*i)));
}
reverse(v.begin(),v.end());
vector<ll> v1;
for (int i:v){
int pos=upper_bound(v1.begin(),v1.end(),i)-v1.begin();
if (pos==v1.size()){
v1.pb(i);
}else{
if (v1[pos]!=0){
v1[pos]=i;
}
}
}
int cnt=0;
for (auto o:v1){
if (o>m){
cnt++;
}
}
cout << n-v1.size()+cnt << 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... |