# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
774587 | vgoofficial | Rabbit Carrot (LMIO19_triusis) | C++14 | 23 ms | 4164 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;
using ll = long long;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
int heights[n];
for(int i = 0; i < n; i++) {
int h;
cin >> h;
h-=(i+1)*m;
heights[i]=h;
}
vector<int> magic;
int i = n-1;
for(; i >= 0; i--) {
if(heights[i]>0) continue;
magic.push_back(heights[i]);
i--;
break;
}
for(;i>=0;i--) {
if(heights[i]>0) continue;
int ub = upper_bound(begin(magic), end(magic), heights[i])-begin(magic);
if(ub==magic.size()) {
magic.push_back(heights[i]);
} else {
magic[ub]=heights[i];
}
}
cout << n-magic.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... |