# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086608 | firegirlwaterboy | Rabbit Carrot (LMIO19_triusis) | C++14 | 29 ms | 5336 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;
typedef long long ll;
typedef pair<int, int> pii;
void solve() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int &p : a) {
cin >> p;
}
vector<int> b;
for (int i = 1; i <= n; i++) {
if (i * m >= a[i - 1]) {
b.push_back(i * m - a[i - 1]);
}
}
vector<int> ans;
for (int i : b) {
int idx = upper_bound(ans.begin(), ans.end(), i) - ans.begin();
if (idx == ans.size()) {
ans.push_back(i);
} else {
ans[idx] = i;
}
}
cout << n - ans.size() << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
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... |