Pagini recente » Cod sursa (job #2558142) | Cod sursa (job #226185) | Cod sursa (job #180481) | Cod sursa (job #2666431) | Cod sursa (job #355452)
Cod sursa(job #355452)
#include<stdio.h>
#define dim 500001
using namespace std;
int A[dim], deque[dim];
int main()
{ int N,K,i,min,in,sf,capat;
FILE *f = fopen("secventa.in", "r");
FILE *g = fopen("secventa.out", "w");
fscanf(f, "%d%d", &N, &K);
for(i = 1; i <= N; i++)
fscanf(f, "%d", &A[i]);
min = capat = -30001;
in = sf = 1;
for(i = 1; i <= N; i++)
{
while(in <= sf && A[deque[sf]] >= A[i]) sf--;
deque[++sf] = i;
if (i - deque[in] == K) in++;
if (A[deque[in]] > min && i >= K)
//if(i >= K)
min = A[deque[in]], capat = i;
}
fprintf(g, "%d %d %d\n", capat-K+1, capat, min);
fclose(f);
fclose(g);
return 0;
}