Pagini recente » Cod sursa (job #864365) | Cod sursa (job #2804382) | Cod sursa (job #939286) | Cod sursa (job #278109) | Cod sursa (job #1984207)
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
#define lim 500001
int v[lim],n,k,rez,st,dr;
deque <int> D;
#define maxb 300
char buff[maxb];
int pos=0;
int get_int()
{
int nr=0;
while(buff[pos]<'0' || buff[pos]>'9')
if(++pos==maxb) fin.read(buff,maxb),pos=0;
while(buff[pos]>='0' && buff[pos]<='9')
{
nr=nr*10+buff[pos]-'0';
if(++pos==maxb) fin.read(buff,maxb),pos=0;
}
return nr;
}
int main()
{
fin>>n>>k;
for(int i=1; i<=n; i++)
fin>>v[i];
rez=-lim;
D.push_back(1);
for(int i=2; i<=n; i++)
{
while(!D.empty() && v[i]<=v[D.back()])
D.pop_back();
D.push_back(i);
while(!D.empty() && i-D.front()>=k)
D.pop_front();
if(!D.empty() && i>=k && v[D.front()]>rez)
{
rez=v[D.front()];
st=i-k+1;
dr=i;
}
}
fout<<st<<' '<<dr<<' '<<rez;
fin.close();
fout.close();
return 0;
}