# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389839 | SirCovidThe19th | Rabbit Carrot (LMIO19_triusis) | C++14 | 145 ms | 12276 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>
using namespace std;
int main() {
//poles, max leap
int n, m;
cin >> n >> m;
vector<int> seq;
for (int i = 1; i <= n; i++){
int a;
cin >> a;
if (i*m >= a)
seq.push_back(m*i-a);
}
multiset<int> dp;
for (int i = 0; i < seq.size(); i++){
auto pos = dp.upper_bound(seq[i]);
dp.insert(seq[i]);
if (pos != dp.end())
dp.erase(pos);
}
cout<<n-dp.size();
}
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... |