# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433138 | jli12345 | Rabbit Carrot (LMIO19_triusis) | C++11 | 37 ms | 4168 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;
void fastIO(){
ios_base::sync_with_stdio(false);
cin.tie(0);
}
int N, M;
int arr[200100];
int main(){
fastIO();
cin >> N >> M;
for (int i = 1; i <= N; i++){
cin >> arr[i];
arr[i] -= M*i;
arr[i] = -arr[i];
}
vector<int> v;
for (int i = 0; i <= N; i++){
if (arr[i] < 0)
continue;
int pos = upper_bound(v.begin(), v.end(), arr[i])-v.begin();
if (pos == v.size()){
v.push_back(arr[i]);
} else {
v[pos] = arr[i];
}
}
cout << N+1-v.size() << "\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... |