Pagini recente » Cod sursa (job #2774145) | Cod sursa (job #683513) | Cod sursa (job #1122273) | Cod sursa (job #2536151) | Cod sursa (job #1718412)
#include <bits/stdc++.h>
using namespace std;
deque<int>q;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int a[500005],n,k;
void Citire()
{
int i;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
}
int main()
{
int i,x,minim=-30005,inceput,sfarsit;
Citire();
for(i=1;i<=n;i++)
{
x=a[i];
while(!q.empty() and a[q.back()]>=x)
q.pop_back();
q.push_back(i);
if(i-k>=q.front())
q.pop_front();
if(minim<a[q.front()] and i>=k)
{
minim=a[q.front()];
sfarsit=i;
}
}
inceput=sfarsit-k+1;
fout<<inceput<<" "<<sfarsit<<" "<<minim<<"\n";
fin.close();
fout.close();
}