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;
int main()
{
size_t n;
uint64_t m;
cin >> n >> m;
vector<uint64_t> a(n + 2);
for (size_t i = 1; i <= n; i++)
cin >> a[i];
a[0] = a[n + 1] = 0;
vector<uint64_t> b;
for (size_t i = 0; i < n + 2; i++)
{
if (a[i] <= m * i)
b.push_back(m * i - a[i]);
}
vector<uint64_t> dp;
for (uint64_t const &x : b)
{
auto it = upper_bound(dp.begin(), dp.end(), x);
if (it == dp.end())
dp.push_back(x);
else
*it = x;
}
cout << n + 2 - dp.size() << '\n';
}
# | 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... |