Cod sursa(job #1245260)
Utilizator | Data | 18 octombrie 2014 21:02:03 | |
---|---|---|---|
Problema | Zombie | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream in("zombie.in");
ofstream out("zombie.out");
int d,k,n,a[1000005];
int main()
{
in>>n>>d>>k;
for(int i=1;i<=n;i++)
in>>a[i];
int last,first=1,sum=0;;
for(last=2;last<=n;last++)
if(a[last]-a[first]>=d)
sum+=min(last-first,k),first=last;
sum+=min(last-first,k);
out<<sum<<'\n';
out.close();
return 0;
}