Pagini recente » Borderou de evaluare (job #1550850) | Cod sursa (job #676619) | Cod sursa (job #2587067) | Cod sursa (job #2267743) | Cod sursa (job #1300770)
#include<stdio.h>
using namespace std;
int sol,d,k,x,elem,i,n,v[10000004];
int main()
{
freopen("zombie.in","r",stdin);
freopen("zombie.out","w",stdout);
scanf("%d%d%d",&n,&d,&k);
int last=1;
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
if(i!=1)
{
if(v[i]-v[last]>=d){
if(i-last>k)
sol+=k;
else
sol+=i-last;
last=i;
}
}
}
if(n-last>k)
sol+=k;
else
sol+=i-last;
printf("%d",sol);
return 0;
}