Pagini recente » Cod sursa (job #1298132) | Cod sursa (job #880649) | Cod sursa (job #1793693) | Cod sursa (job #1770148) | Cod sursa (job #2789586)
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
deque <int> q;
int main()
{
int n,k,v[500005],st=0,dr=0,maxx=-(1<<30);
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>v[i];
for(int i=1;i<=k;i++)
{
while(!q.empty() and v[q.back()]>=v[i])
q.pop_back();
q.push_back(i);
}
maxx=v[q.front()];
for(int i=k+1;i<=n;i++)
{
while(!q.empty() and v[q.back()]>=v[i])
q.pop_back();
q.push_back(i);
while(!q.empty() and q.front()<i-k+1)
q.pop_front();
if(maxx<v[q.front()])
{
maxx=v[q.front()];
st=i-k+1;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<maxx;
}