Cod sursa(job #71737)
Utilizator | Data | 11 iulie 2007 15:00:31 | |
---|---|---|---|
Problema | Secventa | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <stdio.h>
int a[500000];
int main() {
int n, k, i, j, min, max=-32000, pi;
FILE *f = fopen("secventa.in", "r");
FILE *g = fopen("secventa.out", "w");
fscanf(f, "%d %d", &n, &k);
for (i = 0; i < n; ++i)
fscanf(f, "%d", &a[i]);
for (i = 0; i <= n - k; ++i){
min = a[i];
for (j = 1; j < k; ++j)
if (a[i + j] < min) min = a[i + j];
if (min > max) max = min, pi=i;
}
pi++;
fprintf(g, "%d %d %d\n", pi, pi+k-1, max);
fclose(f);
fclose(g);
return 0;
}