# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
691806 | tamyte | Rabbit Carrot (LMIO19_triusis) | C++14 | 94 ms | 8356 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>
#define f first
#define s second
using namespace std;
typedef long long ll;
const int MAX = 1e6 + 5;
int lis(vector<ll>& arr) {
vector<ll> dp;
for (auto u : arr) {
int i = upper_bound(dp.begin(), dp.end(), u) - dp.begin();
if (i == dp.size()) dp.push_back(u);
else dp[i] = u;
}
return dp.size();
}
int main()
{
// ifstream cin("lmio_2012_3e1_makaronas_vyr.in");
// ofstream cout("lmio_2012_3e1_makaronas_vyr.out");
int n, m;
cin >> n >> m;
vector<ll> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
vector<ll> unchange;
for (int i = 0; i < n; ++i) {
int j = i + 1;
if (m * j >= arr[i]) {
unchange.push_back(m * j - arr[i]);
}
}
cout << n - lis(unchange);
}
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... |