Pagini recente » Cod sursa (job #289269) | Cod sursa (job #2538506) | Cod sursa (job #1969832) | Cod sursa (job #886649) | Cod sursa (job #2777916)
#include <fstream>
using namespace std;
ifstream cin ("zombie.in");
ofstream cout ("zombie.out");
int v[1000005], v2[1000005], d[1000005];
int main()
{
int d, n, k, st=0, dr=0, sol=0, nr1, nr2;
cin >> d >> n >> k;
for (int i = 0; i < n; i++)
cin >> v[i];
while (dr < n)
{
if (v[dr] <= v[st] + d)
dr++;
else
st++;
v2[dr] = st;
}
d[0] = 1;
for (i = 1; i < n; i++)
{
nr1 = d[i - 1] + 1;
nr2 = d[v2[i] - 1] + k;
if (nr1 < nr2)
d[i] = nr1;
else
d[i] = nr2;
}
cout << d[n - 1];
return 0;
}