# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095664 | I_FloPPed21 | Rabbit Carrot (LMIO19_triusis) | C++14 | 54 ms | 4300 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;
const int N=2e5+1;
int n,v[N],m;
vector<int>lis;
void add_to_lis(int val)
{
int pos=upper_bound(lis.begin(),lis.end(),val)-lis.begin();
if(pos==lis.size())
lis.push_back(val);
else
lis[pos]=val;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
for(int i=1;i<=n;i++)
{
if(v[i]<=m*i)
{
add_to_lis(i*m-v[i]);
}
}
cout<<n-lis.size()<<'\n';
return 0;
}
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... |