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