Pagini recente » Cod sursa (job #2028163) | Cod sursa (job #2345817) | Cod sursa (job #385197) | Cod sursa (job #1938689) | Cod sursa (job #42226)
Cod sursa(job #42226)
// Problema secventa
#include <stdio.h>
#define MAX 500001
#define MAXIM 32000
int sir[MAX];
int minim[MAX];
int main()
{
long n, k, i, pozmin, p, q;
int min, max;
freopen( "secventa.in" , "rt", stdin );
scanf( "%ld %ld", &n, &k );
for( i=1; i<=n; i++ ) scanf( "%d", &sir[i] );
max = -MAXIM;
pozmin = 0;
p = 1;
q = p;
while( p <= n )
{
min = MAXIM;
for( i=p; (i<=p+k-1) && (i <=n ); i++ )
if( sir[i] < min )
{
pozmin = i;
min = sir[i];
}
if( (min > max) && (i-p == k) )
{
q = p;
max = min;
}
p = pozmin +1;
}
fclose( stdin );
freopen( "secventa.out", "wt", stdout );
printf( "%ld %ld %d\n", q, q+k-1, max );
fclose( stdout );
return 0;
}