Pagini recente » Cod sursa (job #2488201) | Cod sursa (job #1498175) | Istoria paginii runda/arhiva-vianu/clasament | Cod sursa (job #1851083) | Cod sursa (job #1506675)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[500001],deq[500001],k,n;
int minim=-30001,p1,p2;
int main()
{
f>>n>>k;
int i,prim=1,ultim=0;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
while(a[i]<=a[deq[ultim]] && prim<=ultim)
ultim--;
ultim++;
deq[ultim]=i;
if(deq[prim]==i-k)
prim++;
if(i>=k && minim<a[deq[prim]])
{
p1=deq[prim];
minim=a[deq[prim]];
}
}
g<<p1<<" "<<p1+k-1<<" "<<minim;
return 0;
}