| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1216558 | howsoxor | Rabbit Carrot (LMIO19_triusis) | C++20 | 1 ms | 324 KiB |
#include <bits/stdc++.h>
using namespace std;
int lnds(const vector<int>& a) {
vector<int> t;
for (int v : a) {
auto p = upper_bound(t.begin(), t.end(), v);
if (p == t.end()) t.push_back(v);
else *p = v;
}
return t.size();
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> A;
A.reserve(n);
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
int d = i * m - x;
if (d >= 0) A.push_back(d);
}
int L = lnds(A);
cout << (n + 1 - L) << "\n";
return 0;
}
| # | 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... | ||||
