# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
902525 | vanea | Rabbit Carrot (LMIO19_triusis) | C++14 | 26 ms | 5320 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(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> v(n), b;
for(int i = 0; i < n; i++) {
cin >> v[i];
}
for(int i = 0; i < n; i++) {
if(v[i] <= (1+i) * m)
b.push_back((i+1)*m-v[i]);
}
vector<int> dp;
for(int i = 0; i < b.size(); i++) {
auto it = upper_bound(dp.begin(), dp.end(), b[i]);
if(it == dp.end()) dp.push_back(b[i]);
else *it = b[i];
}
cout << n-dp.size();
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... |