# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
713399 | mtxas | Rabbit Carrot (LMIO19_triusis) | C++14 | 84 ms | 4788 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;
void solve()
{
const int inf = 0x3f3f3f3f;
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
for(int i = 1; i <= n; ++i)
{
cin >> a[i];
}
/// solve it
vector<int> b;
for(int i = 1; i <= n; ++i)
{
if(a[i] <= i * m)
{
b.push_back(i * m - a[i]);
}
}
auto lis = [&] (vector<int> &v) -> int
{
int maxlen = 0;
vector<int> dp(v.size());
for(int i = 0; i < v.size(); ++i)
{
int x = upper_bound(dp.begin(), dp.begin() + maxlen, v[i]) - dp.begin();
if(x == maxlen)
{
maxlen++;
}
dp[x] = v[i];
}
return maxlen;
};
cout << n - lis(b) << '\n';
}
signed main()
{
solve();
}
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... |