# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
669469 | smash | Rabbit Carrot (LMIO19_triusis) | C++14 | 0 ms | 212 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 n,m;
int main()
{
cin>>n>>m;
vector<int>a(n);
vector<int>d;
vector<int>b;
for(int i=0; i<n; i++)
{
cin>>a[i];
}
for(int i=0; i<n; i++)
{
if(m*(i+1)>a[i])
{
b.push_back(m*(i+1)-a[i]);
}
}
for(auto x:b)
{
int pos=upper_bound(d.begin(),d.end(),x)-d.begin();
if(pos==d.size())
{
d.push_back(x);
}
else
{
d[pos]=x;
}
}
cout<<n-d.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... |