# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
762546 | AutomatiC__ | Rabbit Carrot (LMIO19_triusis) | C++17 | 1 ms | 340 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 <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cctype>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cstdlib>
#include <bitset>
#include <deque>
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3fll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200005;
ll a[maxn];
ll n, m;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
vector<ll> vec;
for (int i = 1; i <= n; i++) {
if (m * i - a[i] >= 0) vec.push_back(m * i - a[i]);
}
vector<ll> dp;
for (int i = 0; i < vec.size(); i++) {
if (dp.empty() || vec[i] >= dp.back()) {
dp.push_back(vec[i]);
} else {
int pos = lower_bound(dp.begin(), dp.end(), vec[i]) - dp.begin();
dp[pos] = vec[i];
}
}
cout << n - dp.size() << endl;
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... |