Pagini recente » Cod sursa (job #1530432) | Cod sursa (job #969847) | Cod sursa (job #2425132) | Cod sursa (job #2729233) | Cod sursa (job #1103546)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int i,n,k,v[500005],maxi,begn,j,mini;
int main()
{
fin >> n >> k;
maxi=-30005;
for (i=1; i<=n; i++)
fin >> 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;
}
}
fout << begn << " " << begn+k-1 << " " << maxi;
fin.close();
fout.close();
return 0;
}