Pagini recente » Cod sursa (job #2230389) | Cod sursa (job #2648606) | Cod sursa (job #2372118) | Cod sursa (job #1076368) | Cod sursa (job #89178)
Cod sursa(job #89178)
#include <iostream.h>
#include <stdio.h>
int k;
int n;
int a[500000];
int min;
int b[3]; //b[2]=max
int main()
{
{ //citire;
freopen("graf.in","r",stdin);
scanf("%d",&n);
scanf("%d",&k);
for (int i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
fclose;
};
b[2]=0;b[0]=0;b[1]=k-1;
for (int i=0;i<n-k+1;i++)
{
min=a[i];
for (int j=i;j<k+i;j++)
{
if (a[j]<min) { min=a[j];};
};
if (min>b[2])
{
b[2]=min;b[0]=i;b[1]=i+k-1;
};
}
cout << b[0]+1; cout << " ";
cout << b[1]+1; cout << " ";
cout << b[2]; cout << " ";
return 0;
}