# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731333 | dubabuba | Rabbit Carrot (LMIO19_triusis) | C++14 | 106 ms | 5332 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;
const int mxn = 2e5 + 10;
int a[mxn], n, m;
vector<int> sus;
int LIS() {
vector<int> dp;
for(int x : sus) {
int i = upper_bound(dp.begin(), dp.end(), x) - dp.begin();
if(i == dp.size()) dp.push_back(x);
else dp[i] = x;
}
return dp.size();
}
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> a[i];
if(m * i - a[i] >= 0)
sus.push_back(m * i - a[i]);
}
cout << n - LIS();
return 0;
}
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... |