Pagini recente » Cod sursa (job #2595916) | Cod sursa (job #2700493) | Cod sursa (job #2305167) | Cod sursa (job #1537662) | Cod sursa (job #2453415)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("zombie.in");
ofstream out("zombie.out");
const int dim = 1000005;
int n,d,k,timp[dim];
int q[dim],st,dr,consum;
int main()
{
in >> d >> n >> k;
for (int i=1; i<=n; i++)
{
in >> timp[i];
}
int cate;
st = 0;
dr = -1;
q[++dr] = timp[1];
for (int i=2; i<=n; i++)
{
cate = 0;
while (st <= dr && timp[i] - q[st] >= d)
{
st++;
cate++;
}
q[++dr] = timp[i];
consum += min(cate , k);
}
if (st <= d) consum += k;
out << consum;
return 0;
}