# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636330 | gromperen | Rabbit Carrot (LMIO19_triusis) | C++14 | 25 ms | 4180 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 ll long long
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m; cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i] -= (i+1)*m;
}
reverse(a.begin(), a.end());
vector<int>dp;
for (int i = 0; i < n; ++i) {
if (a[i]>0) continue;
int j = upper_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
if (j == dp.size()) dp.push_back(a[i]);
else dp[j] = a[i];
}
cout << n - dp.size() << "\n";
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... |