Pagini recente » Borderou de evaluare (job #1593526) | Cod sursa (job #1347905) | Borderou de evaluare (job #402145) | Cod sursa (job #2977522) | Cod sursa (job #635292)
Cod sursa(job #635292)
#include <iostream>
#include <fstream>
using namespace std;
FILE* fin = fopen("zombie.in", "r");
FILE* fout = fopen("zombie.out", "w");
typedef long long int64;
#define MAXN 1000100
int64 d, n, k;
int main()
{
fscanf (fin, "%lld %lld %lld\n", &d, &n, &k);
int64 sol = 0, b;
fscanf (fin, "%lld ", &b);
for (int i = 1; i <= n; ++i) {
int j = i;
int64 a = b;
while (a - b < d && j <= n) {
++j;
fscanf(fin, "%lld ", &a);
}
if (j - i > k) {
sol += k;
} else {
sol += j - 1;
}
b = a;
i = j - 1;
}
fprintf(fout, "%lld\n", sol);
fclose(fin);
fclose(fout);
return 0;
}