# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797221 | andecaandeci | Rabbit Carrot (LMIO19_triusis) | C++17 | 91 ms | 6496 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>
#define int long long
#define pb push_back
using namespace std;
int n , m , a[200005] ;
vector < int > b;
vector < int > v;
signed main(){
cin >> n >> m;
for(int i = 1 ; i <= n ; i++){
cin >> a[i];
if(m * i >= a[i]) b.pb(m * i - a[i]);
}
for(int i = 0 ; i < b.size() ; i++){
int idx = upper_bound(v.begin() , v.end() , b[i]) - v.begin();
if(idx == v.size()) v.pb(b[i]);
else v[idx] = b[i];
}
cout << n - v.size() << 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... |