| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 876058 | tinnhiemnn | Rabbit Carrot (LMIO19_triusis) | C++14 | 63 ms | 5380 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;
#define file "file"
const long long N=2e5+5;
long long n,M,i,j,res,f[N];
vector<long long> v;
int main()
{
//freopen(file".inp", "r", stdin);
//freopen(file".out", "w", stdout);
ios_base::sync_with_stdio(); cin.tie();
cin>>n>>M;
for (i=1;i<=n;i++)
{
cin>>j;
if (M*i >= j) v.push_back(M*i-j);
}
if (v.size()==0) {cout<<n; return 0;}
f[1]=v[0]; res=1;
for (i=1;i<v.size();i++)
{
if (v[i]>=f[res]) {res++; f[res]=v[i]; continue;}
j=upper_bound(f+1, f+res+1, v[i]) - f;
f[j]=v[i];
}
cout<<n-res;
}
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... | ||||
