Pagini recente » Cod sursa (job #283539) | Cod sursa (job #266427) | Cod sursa (job #1152917) | Cod sursa (job #1936004) | Cod sursa (job #214554)
Cod sursa(job #214554)
#include <stdio.h>
int n,p,v[500005];
void citirith()
{
scanf("%d%d",&n,&p);
for (int i=1; i<=n; i++)
scanf("%d",&v[i]);
}
void rezolvarith()
{
int sol,min,pozmax,poz;
sol=v[1]; pozmax=1;
for (int i=1; i<=p; i++)
if (v[i]<sol)
{
sol=v[i];
pozmax=i;
}
int j;
for (int i=pozmax+1; i<=n-p+1; i++)
{
min=30005;
for (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",pozmax,pozmax+p-1,sol);
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
citirith();
rezolvarith();
}