# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1229082 | Hduong | Rabbit Carrot (LMIO19_triusis) | C++20 | 17 ms | 4032 KiB |
#include <bits/stdc++.h>
#define task "task"
using namespace std;
const long long INF = 1e18;
const int N = 2e5 + 5;
long long n, m, a[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i], a[i] = m*i - a[i];
vector <long long> v;
long long res = n;
for (int i = 1; i <= n; i++) {
if (a[i] < 0) continue ;
auto it = upper_bound(v.begin(), v.end(), a[i]);
if (it == v.end()) {
v.push_back(a[i]);
}
else {
*it = a[i];
}
}
cout << res - v.size();
}
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... |