Cod sursa(job #1382189)
Utilizator | Data | 8 martie 2015 16:10:20 | |
---|---|---|---|
Problema | Zombie | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int a[1000004],i,j,k,n,sol,d,p;
int main()
{
ifstream cin("zombie.in");
ofstream cout("zombie.out");
cin>>d>>n>>k;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
p=1;
for(i=2;i<=n;i++)
if(a[i]-a[p]>=d){
sol+=min(i-p,k);
p=i;
}
sol+=min(i-p,k);
cout<<sol;
return 0;
}