Pagini recente » E | Tabele hash - prezentare detaliata | Profil Sanke | Istoria paginii utilizator/alexandravarutu | Cod sursa (job #2069749)
// http://www.infoarena.ro/problema/secventa
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,i,j,minn,v[500005],st,dr,baza[500005],rez;
int main()
{
fin >> n >>k;
for(i=1; i<=n; i++)
fin >> v[i];
rez = -2147483647;
for(i=1; i<=n-k+1; i++)
{
minn = 2147483647;
for(j=i; j<=i-1+k; j++)
minn = min(minn, v[j]);
if(minn > rez)
{
rez = minn;
st = i;
dr = i+k-1;
}
}
//minn = ;
/*for(i=1; i<=n; i++)
if(baza[i]>minn)
{
minn = baza[i];
st = i;
dr = i+k-1;
}*/
fout << st << " " << dr << " " << minn;
}