| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 954472 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 1 ms | 600 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 fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
int main() {
fastio;
int n, m, i;
cin >> n >> m;
vector<int> poles;
for (i = 1; i <= n; i++) {
int a;
cin >> a;
if (a - i * m > 0) {
continue;
}
poles.push_back(a - i * m);
}
// for (i = 0; i < poles.size(); i++) {
// cout << poles[i] << ' ';
// }
// cout << endl << endl;
vector<int> s;
vector<int> v (n + 1, 0);
int last_used = 0;
int best_ans = 0;
for (i = 0; i < poles.size(); i++) {
auto it = lower_bound(s.begin(), s.end(), poles[i]);
if (it == s.end()) {
//cout << "new deck" << endl;
s.push_back(poles[i]);
v[last_used]++;
last_used++;
best_ans = max(best_ans, 1);
//cout << "bestans " << best_ans << endl;
continue;
}
s[it - s.begin()] = poles[i];
//cout << "inserted into deck " << it - s.begin() << '\n';
v[it - s.begin()]++;
best_ans = max(best_ans, v[it - s.begin()]);
//cout << "best ans " << best_ans << endl;
}
// for (auto ss : s) {
// cout << ss << ' ';
// }
//cout << endl << endl;
cout << n - best_ans << '\n';
}
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... | ||||
