Pagini recente » Cod sursa (job #2162476) | Cod sursa (job #475948) | Cod sursa (job #1242646) | Clasament preoni21204 | Cod sursa (job #1011414)
#include<fstream>
#include<iostream>
#include<deque>
#define inf -0x3f3f3f3f
#define N_max 5000005
using namespace std;
int v[N_max];
deque <int> a;
int n,k,bazmax,i1,i2;
int main()
{int i,x;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
fin>>n>>k;
bazmax=inf;
for(i=1;i<=n;i++)
{
fin>>x;
v[i]=x;
}
for(i=1;i<=n;i++)
{
while(!a.empty()&&v[i]<v[a.front()])
a.pop_back();
a.push_back(i);
if(a.front()==i-k)
a.pop_front();
if(i>=k)
{
if(v[a.front()]>bazmax)
{
bazmax=v[a.front()];
i1=i-2;
i2=i;
}
}
}
fout<<i1<<" "<<i2<<" "<<bazmax;
}