Pagini recente » Cod sursa (job #616735) | Cod sursa (job #2253367) | Cod sursa (job #141164) | Cod sursa (job #10192) | Cod sursa (job #592479)
Cod sursa(job #592479)
#include<fstream>
using namespace std;
int deque[5000005],sir[5000005];
int main()
{
int n,k,i,front,back,x=-30002,fata;
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for(i=1;i<=n;++i)
f>>sir[i];
front=1;
back=0;
for(i=1;i<=n;++i)
{
while(front<=back && sir[i]<=sir[deque[back]]) --back;
deque[++back]=i;
if(i-k==deque[front]) ++front;
if(i>=k && sir[deque[front]]>x)
{
fata=i;
x=sir[deque[front]];
}
}
g<<fata-k+1<<' '<<fata<<' '<<x;
f.close();
g.close();
return 0;
}