Cod sursa(job #1218646)
| Utilizator | Data | 12 august 2014 04:41:06 | |
|---|---|---|---|
| Problema | Zombie | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
# include <fstream>
# include <iostream>
# define nmax 1000005
using namespace std;
ifstream fi("zombie.in");
ofstream fo("zombie.out");
int S[nmax];
int main(void)
{
int n,d,k;
long long M=0;
fi>>d>>n>>k;
for (int i=1;i<=n;++i) fi>>S[i];
for (int i=1;i<=n;++i)
{
int p=S[i],f=i;
while (S[i+1]<=p+d && i<n) ++i;
if (k<i-f+1) M+=k;else M+=(i-f+1);
}
fo<<M<<"\n";
}
