Pagini recente » Cod sursa (job #597865) | Cod sursa (job #2288799) | Cod sursa (job #902919) | Cod sursa (job #2205766) | Cod sursa (job #1977972)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int main()
{
int n,k,a[100],i,j,e,f,maxim=0,minim,x;
in>>n>>k;
for(i=1; i<=n; i++)
in>>a[i];
i=1;
j=i+k-1;
while(i<=n-k+1)
{
minim=999999999;
for(x=i; x<=j; x++)
if(a[x]<minim)
minim=a[x];
if(minim>maxim)
{
maxim=minim;
e=i;
f=j;
}
if(minim=maxim)
{
if(i<e)
{
maxim=minim;
e=i;
f=j;
}
if(i==e)
if(j<f)
{
maxim=minim;
e=i;
f=j;
}
}
i++;
j++;
}
out<<e<<" "<<f<<" "<<maxim;
return 0;
}