Pagini recente » Cod sursa (job #917678) | Cod sursa (job #523891) | Cod sursa (job #612536) | Cod sursa (job #2633283) | Cod sursa (job #1660902)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int a[100],n,k,i, b[100],x, max;
ifstream fin ("secvente.in");
ofstream fout ("secvente.out");
fin>>n>>k;
for (i=1;i<=n;i++)
fin>>a[i];
for (x=1;x<n-k+2;x++)
{
max=a[x];
for (i=x+1;i<x+k;i++)
{
if (a[i]<max) max=a[i];
}
b[x]=max;
}
max=b[1];
for (x=1;x<=n-k+1;x++)
{
if (b[x]>max) {max=b[x];i=x;}
}
fout<<i<<" "<<i+k-1<<" "<<max;
return 0;
}