Pagini recente » Cod sursa (job #2840692) | Cod sursa (job #1422425) | Cod sursa (job #389224) | Cod sursa (job #2655106) | Cod sursa (job #1937744)
#include <iostream>
#include <fstream>
using namespace std;
int v[500000],mn,mn1,mx=0,p;
long long n,k,i,j,nr;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>v[i];
}
for (i=1;i<=n-k+1;i++)
{
nr=1;
j=i;
mn=v[i];
while(nr<=k)
{
if (v[j]<mn) {mn=v[j];j++;nr++;}
else {j++;nr++;}
}
if (mn>mx) {p=i;mx=mn;}
}
g<<p<<" "<<p+k-1<<" "<<mx;
return 0;
}