Pagini recente » Cod sursa (job #2084460) | Cod sursa (job #2050681) | Cod sursa (job #1932300) | Cod sursa (job #473726) | Cod sursa (job #2683677)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque <int> d;
int n,k,x,v[500001],mx=-2e9;
int pi,pj;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=n;i++)
{
while(!d.empty()&&v[d.back()]>=v[i])
d.pop_back();
d.push_back(i);
if(d.front()<=i-k)
d.pop_front();
if(i>=k&&v[d.front()]>mx)
{
mx=v[d.front()];
//cout<<"mx "<<mx<<endl;
pi=d.front();
pj=d.back();
}
/*for(deque<int>::iterator i=d.begin();i<d.end();i++)
cout<<v[*i]<<" ";
cout<<endl;*/
}
fout<<pi<<" "<<pj<<" "<<mx;
}