Cod sursa(job #1242800)
| Utilizator | Data | 15 octombrie 2014 00:45:55 | |
|---|---|---|---|
| Problema | Zombie | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("zombie.in");
ofstream g ("zombie.out");
const int NMAX = 1000000 + 1;
int n, d, k;
int v[NMAX];
void citeste() {
f >> d >> n >> k;
for (int i = 1; i <= n; i++) f >> v[i];
}
void rezolva() {
int x = 1, sol = 0;
for (int i = 2; i <= n; i++)
if (v[i] - v[x] >= d) {
sol = sol + min(i - x, k);
x = i;
}
sol = sol + min(n - x, k);
g << sol << '\n';
}
int main() {
citeste();
rezolva();
return 0;
}
