Pagini recente » Cod sursa (job #2743711) | Cod sursa (job #1459732) | Cod sursa (job #2417022) | Cod sursa (job #1112683) | Cod sursa (job #1864349)
#include <fstream>
#include <deque>
#define hg 1<<5
#define verf ++poz == hg ? fin.read (ch, hg), poz = 0 : 0
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int k,n,pozi,pozj,minim=-30001,v[500001],poz;
char ch[hg];
deque < int > coada;
inline void cit( int &x ) {
if (ch[0] == '\0') fin.read (ch, hg) ;
else for (; ch[poz] < '0' || ch[poz] > '9' ; verf) ;
for (x = 0 ; ch[poz] >= '0' && ch[poz] <= '9' ; x = x * 10 + ch[poz] - '0', verf) ;
}
int main()
{
int i;
int x;
cit(n);cit(k);
for(i=1;i<=n;i++)
cit(v[i]);
coada.push_back(1);
for(i=2; i<=n; i++)
{
while(!coada.empty() && v[i]<=v[coada.back()])
coada.pop_back();
coada.push_back(i);
if(i-coada.front()>=k)
coada.pop_front();
if(i>=k && v[coada.front()]>minim)
{
minim=v[coada.front()];
pozi=i-k+1;
pozj=i;
}
}
fout<<pozi<<' '<<pozj<<' '<<minim;
fin.close();
fout.close();
return 0;
}