| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 954490 | vjudge1 | Rabbit Carrot (LMIO19_triusis) | C++17 | 21 ms | 2776 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);
}
vector<int> s;
int best_ans = 0;
for (i = 0; i < poles.size(); i++) {
auto it = upper_bound(s.begin(), s.end(), poles[i], greater<int>());
if (it == s.end()) {
s.push_back(poles[i]);
best_ans++;
continue;
}
s[it - s.begin()] = poles[i];
}
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... | ||||
