Pagini recente » Cod sursa (job #1038140) | Cod sursa (job #1958148) | Cod sursa (job #1253086) | Cod sursa (job #1846039) | Cod sursa (job #1610172)
#include <iostream>
#include <fstream>
using namespace std;
int min(int a,int b)
{
if(a<b)
return a;
return b;
}
int main()
{
fstream f1,f2;
int n,k,i,j,v[500000],max,s,d;
f1.open("secventa.in",ios::in);
f2.open("secventa.out",ios::out);
f1>>n>>k;
for(i=0;i<n;i++)
f1>>v[i];
max=min(v[0],min(v[1],v[2]));
s=0;d=k-1;
for(i=0;i<=n-k;i++)
if(min(v[i],min(v[i+1],v[i+2]))>max){
max=min(v[i],min(v[i+1],v[i+2]));
s=i+1;d=i+k;}
f2<<s<<" "<<d<<" "<<max;
f1.close();
f2.close();
return 0;
}