Pagini recente » Cod sursa (job #186426) | Cod sursa (job #60690) | Cod sursa (job #2768081) | Cod sursa (job #889450) | Cod sursa (job #1103548)
#include <fstream>
#include <cstdio>
using namespace std;
int i,n,k,v[500005],maxi,begn,j,mini;
int main()
{
freopen("secventa.in", "r", stdin);
freopen("secventa.out", "w", stdout);
scanf("%d%d", &n, &k);
maxi=-30005;
for (i=1; i<=n; i++)
scanf("%d", &v[i]);
for (i=1; i<=n-k+1; i++)
{
mini=v[i];
for (j=i; j<=i+k-1; j++)
if (mini>v[j])
mini=v[j];
if (mini>maxi)
{
maxi=mini;
begn=i;
}
}
printf("%d %d %d", begn, begn+k-1, maxi);
return 0;
}