Pagini recente » Cod sursa (job #638993) | Cod sursa (job #3290548) | Cod sursa (job #1060693) | Cod sursa (job #1087343) | Cod sursa (job #1462820)
#include <stdio.h>
#include <string.h>
#define nmax 500005
#define SIZE 3500005
int n, k, baza = -nmax, ind;
int a[nmax], deque[nmax], i, j, aux, len;
int first = 1, last = 0;
char string[SIZE];
char *nr;
int main()
{
FILE *in, *out, *out2;
in = fopen("secventa.in", "r");
out = fopen("secventa.out", "w");
out2 = fopen("secventa2.out", "w");
fscanf(in, "%d %d\n", &n, &k);
fprintf(out2, "%d %d\n", n, k);
for (i = 1; i <= n; i++)
{
fscanf(in, "%d ", &a[i]);
fprintf(out2, "%d ", a[i]);
}
/*fgets(string, SIZE, in);
i = 1;
len = strlen(string);
for (j = 0; j < len; j++)
{
aux = j;
if (string[j] == ' ')
continue;
if (string[j] == '-')
j++;
while (string[j] != ' ')
a[i] = a[i]*10 + string[j++] - '0';
a[i++] *= (string[aux] == '-' ? -1 : 1);
fprintf(out2, "%d ", a[--i]);
}*/
for (i = 1; i <= n; i++)
{
while(first <= last && a[i] <= a[deque[last]])
last--;
deque[++last] = i;
if (i - deque[first] == k)
first++;
if (i >= k)
{
if (baza < a[deque[first]])
{
baza = a[deque[first]];
ind = deque[first];
}
}
}
while (ind-1>0 && a[ind-1] >= baza)
ind--;
fprintf(out, "%d %d %d\n", ind, ind + k-1, baza);
fclose(in);
fclose(out);
fclose(out2);
}