Pagini recente » Cod sursa (job #1218956) | Cod sursa (job #1026555) | Cod sursa (job #1365197) | Cod sursa (job #1889396) | Cod sursa (job #271135)
Cod sursa(job #271135)
#include<fstream.h>
#define nx 500005
int a[nx],deque[nx];
int main()
{
ifstream be ("secventa.in");
ofstream ki ("secventa.out");
int n,k,front,back,max=-30005,pos1,pos2,i;
be>>n>>k;
for (i=1;i<=n;++i)
be>>a[i];
be.close(); back=0,front=1;
for (i=1;i<=n;++i)
{
while (front<=back && a[i]<a[deque[back]]) back--;
deque[++back]=i;
if (deque[front]==i-k) front++;
if (i>=k && a[deque[front]]>max)
{
max=a[deque[front]];
pos1=i-k+1;
pos2=i;
}
}
ki<<pos1<<" "<<pos1+k-1<<" "<<max<<'\n';
ki.close();
return 0;
}