Cod sursa(job #1460686)
Utilizator | Data | 13 iulie 2015 15:51:00 | |
---|---|---|---|
Problema | Zombie | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream f("zombie.in");
ofstream g("zombie.out");
int v[1000001],dr,n,st,d,k,i,t,chakra;
int main()
{
f>>d>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
st=1;
for(dr=2;dr<=n;dr++)
if(v[dr]-v[st]>=d){
chakra+=min(dr-st,k);
st=dr;}
g<<(chakra+=min(dr-st,k));
return 0;
}