Cod sursa(job #715532)
Utilizator | Data | 17 martie 2012 13:22:05 | |
---|---|---|---|
Problema | Zombie | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("zombie.in");
ofstream g("zombie.out");
int i,j,k,p,cost,d,n,a[1000001];
int main()
{f>>d>>n>>k;
for(i=1;i<=n;++i)
f>>a[i];
for(i=1;i<=n;i=i)
if(a[k+i]-a[i]>d)
{++cost;
++i;
}
else
{p=i;
cost=cost+k;
while(a[i+k]-a[p]<=d&&i<=n)
++i;
}
g<<cost<<'\n';
f.close();
g.close();
return 0;
}