Pagini recente » Cod sursa (job #1406326) | Cod sursa (job #1964369) | Cod sursa (job #2239360) | Cod sursa (job #2727816) | Cod sursa (job #238191)
Cod sursa(job #238191)
#include <fstream>
using namespace std;
ifstream f ("secventa.in");
ofstream g ("secventa.out");
int main()
{
long long n,k;
int v[500000],min_max,min,i,j,x;
f>>n>>k;
for(i=0;i<n;i++) f>>v[i];
min_max=v[0];
for(i=0;i<n-k+1;i++)
{
min=v[i];
for(j=i;j<i+k;j++) if(v[j]<min) min=v[j];
if(min>min_max) min_max=min,x=i;
}
g<<x+1<<" "<<x+k<<" "<<min_max;
f.close();
g.close();
return 0;
}