Pagini recente » Cod sursa (job #2357435) | Cod sursa (job #2279699) | Cod sursa (job #2628940) | Cod sursa (job #2874698) | Cod sursa (job #214565)
Cod sursa(job #214565)
#include <stdio.h>
int n,p,v[500005];
void citirith()
{
scanf("%d%d",&n,&p);
for (int i=0; i<n; i++)
scanf("%d",&v[i]);
}
void rezolvarith()
{
int sol=31000,min,pozmax,poz=0;
pozmax=1;
for (int i=0; i<p; i++)
if (v[i]<sol)
{
sol=v[i];
pozmax=i;
}
for (int i=pozmax; i<=n-p; i++)
{
min=30005;
for (int j=i; j<i+p; j++)
if (v[j]<min)
{
min=v[j];
pozmax=j;
}
if (min>sol)
{
sol=min;
poz=i;
}
i=pozmax;
}
printf("%d %d %d\n",poz+1,poz+p,sol);
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
citirith();
rezolvarith();
return 0;
}