Submission #521747

#	Time	Username	Problem	Language	Result	Execution time	Memory
521747		penguin133	Rabbit Carrot (LMIO19_triusis)	C++14	63 / 100	1087 ms	1736 KiB

triusis

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

int dp[200005], A[200005];

int main(){
	int n,m, maxi =0 ;cin >> n >> m;
	for(int i=1;i<=n;i++)cin >> A[i];
	for(int i=1;i<=n;i++){
		if(A[i] > m * i)dp[i] = -1e9;
		else {
			for(int j=0;j<i;j++)if(A[i] - m*(i-j) <= A[j])dp[i] = max(dp[i], dp[j] + 1);
		}
		maxi = max(maxi, dp[i]);
	}
	cout << n-maxi;
}

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