Cod sursa(job #1458880)
| Utilizator | Data | 8 iulie 2015 17:35:51 | |
|---|---|---|---|
| Problema | Zombie | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream in("zombie.in");
ofstream out("zombie.out");
const int NMAX= 1000000;
int v[NMAX+5];
int main( ) {
int d, n, k, sol= 0;
in >> d >> n >> k;
for ( int i = 1; i <= n; ++i ) {
in >> v[i];
}
int p = 1;
for ( int i = 2; i <= n; ++i ) {
if ( v[i] - v[p] >= d ) {
sol = sol + min(k, i-p);
p = i;
}
}
sol = sol + min(k, n-p+1);
out << sol << '\n';
return 0;
}
