Cod sursa(job #2606128)
| Utilizator | Data | 27 aprilie 2020 01:35:21 | |
|---|---|---|---|
| Problema | Zombie | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("zombie.in");
ofstream g("zombie.out");
int d, n, k;
int v[1000001];
int main()
{
f >> d >> n >> k;
for (int i=1; i<=n; i++)
f >> v[i];
int rez = 0, peStrada = 1, p = v[1];
for (int i=2; i<=n; i++)
{
if (v[i] - p > d)
{
rez += min(peStrada, k);
peStrada = 0;
p = v[i];
}
peStrada++;
}
rez += min(peStrada, k);
g << rez;
return 0;
}
