Submission #75032

#TimeUsernameProblemLanguageResultExecution timeMemory
75032charlies_mooTelefoni (COCI17_telefoni)C++98
8 / 80
4 ms1236 KiB
#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int n,d,ans;
int a[10001];

int main()
{
	cin>>n>>d;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	int v;
	for(int i=1;i<=n;i++)
	{
		v=i;
		for(int j=min(d+v,n);j>v;j--)
		{
			if(a[j]==0)
			{
				ans++,a[j]++,i=j-1;
				break;
			}
			if(j==v+1)
				i=j-1;
		}
	}
	cout<<ans;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...