Pagini recente » Cod sursa (job #333353) | Borderou de evaluare (job #2222182) | Cod sursa (job #2316158) | Cod sursa (job #1714980) | Cod sursa (job #697592)
Cod sursa(job #697592)
#include<fstream>
using namespace std;
#define nmax 1000002
long long D,x[nmax];
int N,K,s,timp;
int main()
{
ifstream f("zombie.in");
ofstream g("zombie.out");
f>>D>>N>>K;
for(int i=1;i<=N;i++)
f>>x[i];
int timp=0;
for(int i=1;i<N;i++)
{
timp=timp+x[i+1]-x[i];
if(timp<D)
{
int t=i;
while(timp<D && i<N)
{
i++;
timp=timp+x[i+1]-x[i];
}
i--;
timp=0;
if(i-t+1>K) s=s+K;
else s=s+i-t+1;
}
else
{
timp=0;
s++;
}
}
g<<s;
}