Submission #1164688

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164688		Faisal_Saqib	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

#include <bits/stdc++.h>

using namespace std;
const int N=5e3+12;
int a[N];
int n,m;
int recur(int i,int val=0)
{
	if(i>n)
	{
		return 0;
	}
	int mi=n;
	if((a[i]-val)<=m)
		mi=min(mi,recur(i+1,a[i]));
	else
		mi=min(mi,1+recur(i+1,val+m));
	return mi;
}
void solve()
{
	// statement read incorrectly
	cin>>n>>m;
	a[0]=0;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	cout<<recur(1,0)<<endl;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t=1;
	// cin>>t;
	while(t--)solve();
	return 0;
}

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