Submission #1132507

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132507		nikolashami	Rabbit Carrot (LMIO19_triusis)	C++20	100 / 100	20 ms	1864 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

const int N=2e5+4,inf=2e9;
int a[N],f[N],n,m;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin>>n>>m;

    for(int i=0;i<n;++i){
    	cin>>a[i];
    	a[i]=(i+1)*m-a[i];
    }

    f[0]=-inf;
    fill(f+1,f+n+1,inf);

    for(int i=0;i<n;++i){
    	if(a[i]<0)continue;
    	int j=upper_bound(f,f+n+1,a[i])-f;
		  if(f[j-1]<=a[i])f[j]=min(f[j],a[i]);
    }

   	int ans=0;
   	for(int i=1;i<=n;++i)
  		if(f[i]<inf)ans=i;

  	cout<<n-ans;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37