| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1193451 | PakinDioxide | Rabbit Carrot (LMIO19_triusis) | C++17 | 53 ms | 1472 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector <int> d;
d.emplace_back(0);
for (int i = 1; i <= n; i++) {
int e; cin >> e; e -= i*k; e = -e;
int idx = upper_bound(d.begin(), d.end(), e) - d.begin();
if (idx == (int) d.size()) d.emplace_back(e);
else if (idx != 0) d[idx] = e;
}
cout << n + 1 - (int) d.size() << '\n';
}| # | 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... | ||||
