Pagini recente » Cod sursa (job #3173969) | Cod sursa (job #1736640) | Cod sursa (job #1637526) | Cod sursa (job #2382969) | Cod sursa (job #1505714)
#include <iostream>
#include <fstream>
using namespace std;
int maxt,i,k,minv,j,a[500001],n,c1,c2;
int main()
{
ifstream f ("secventa.in");
ofstream g ("secventa.out");
f>>n>>k;
maxt=-30001;
for(i=1;i<=n;i++) f>>a[i];
for(i=1;i<=n-k+1;i++){
minv=30001;
for(j=i;j<=i+k-1;j++)
if(a[j]<minv)minv=a[j];
if(minv>maxt) {
maxt=minv;
c1=i;
c2=i+k-1;
}
}
g<<c1<<" "<<c2<<" "<<maxt;
f.close ();
g.close ();
return 0;
}