Cod sursa(job #1422802)
| Utilizator | Data | 19 aprilie 2015 20:38:36 | |
|---|---|---|---|
| Problema | Zombie | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <cstdio>
#include <algorithm>
#define NMAX 1000007
using namespace std;
int a[NMAX];
int d, n, k;
int main(){
freopen("zombie.in", "r", stdin);
freopen("zombie.out", "w", stdout);
scanf("%d %d %d", &d, &n, &k);
for(int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int poz = 1, Ans = 0;
for(int i = 2; i <= n; ++i)
if(a[i] - a[poz] >= d){
Ans += min(k, i - poz);
poz = i;
}
Ans += min(n - poz, k);
printf("%d\n", Ans);
return 0;
}
