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()
{
int m,n,a[200001],b[200001];
cin>>n>>m;
for(int i=1;i<=n;++i)
{
cin>>a[i];
b[i] = -(a[i] - m*i);
}
a[0] = 0;
b[0] = 0;
vector<int> v;
for(int i=1;i<=n;++i)
{
if(b[i]<0) continue;
else
{
auto it = upper_bound(v.begin(),v.end(),b[i]);
if(v.empty() || it==v.end()) v.push_back(b[i]);
else
{
*it = b[i];
}
}
}
cout<<n-v.size();
}
# | 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... |