| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1335471 | whally | Rabbit Carrot (LMIO19_triusis) | C++20 | 18 ms | 1884 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int lis[200010];
signed main()
{
cin.tie(0)->sync_with_stdio(0);
int n,m; cin >> n >> m;
int mx = 0;
for (int i = 1; i <= n; i++){
int x; cin >> x;
if (m*i < x) continue;
x = m*i-x;
int idx = upper_bound(lis, lis+mx, x) - lis;
if (idx == mx) mx++;
lis[idx] = x;
}
cout << n-mx;
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... | ||||
