Pagini recente » Cod sursa (job #480084) | Cod sursa (job #1146353) | Cod sursa (job #592845) | Cod sursa (job #2059703) | Cod sursa (job #724114)
Cod sursa(job #724114)
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int i,j,n,a[500005],k,imax,jmax,bazmax=-30001,min;
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++) scanf("%d",&a[i]);
for(i=1;i<=n-k+1;i++)
{
for(j=i+k-1;j<=n;j++)
{
min=*min_element(a+i,a+j+1);
if(min>bazmax) {imax=i; jmax=j; bazmax=min;}
}
}
printf("%d %d %d\n",imax,jmax,bazmax);
return 0;
}