# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
885523 | MongHwa | Rabbit Carrot (LMIO19_triusis) | C++17 | 22 ms | 6868 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<ll> cand;
for(int i = 1; i <= n; i++)
{
int x;
cin >> x;
if(m*i - x >= 0)
cand.push_back(m*i-x);
}
vector<ll> ans;
for(int i = 0; i < (int)cand.size(); i++)
{
int pos = upper_bound(ans.begin(), ans.end(), cand[i]) - ans.begin();
if(pos == ans.size())
ans.push_back(cand[i]);
else
ans[pos] = cand[i];
}
cout << n-ans.size() << '\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... |