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>
#define taskname "cowjog"
#define maxn 200010
#define ff first
#define ss second
#define int long long
using namespace std;
int n,T;
int a[maxn],dp[maxn];
int ans=0;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
// freopen(taskname".in","r",stdin);
// freopen(taskname".out","w",stdout);
cin>>n>>T;
a[0]=0;
for (int i=1; i<=n; i++)
{
int x; cin>>x;
a[i]=x-i*T; a[i]=-a[i];
}
fill_n(dp,n+1,2*1e18);
dp[0]=0;
for (int i=1; i<=n; i++)
{
int j=upper_bound(dp,dp+n+1,a[i])-dp;
if (j==0) continue;
ans=max(ans,j);
dp[j]=a[i];
}
cout<<n-ans;
}
# | 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... |