Pagini recente » Cod sursa (job #1795885) | Cod sursa (job #79146) | Cod sursa (job #1248542) | Cod sursa (job #38030) | Cod sursa (job #363937)
Cod sursa(job #363937)
#include<fstream>
using namespace std;
#define FIN "secventa.in"
#define FOUT "secventa.out"
int n,k,a[500001],deque[500001],front,back,sol=-30001,init,bestk;
int main()
{
ifstream in (FIN);
ofstream out(FOUT);
in>>n>>k;
int ind, x;
front=1;back=0;
{front=1;back=0;
for(int j=1;j<=n;j++)
{ in>>a[j];
while(front<=back && a[j]<a[deque[back]]) back--;
deque[++back]=j;
if(deque[front]==j-k) front++;
if(j>=k)if(sol<a[deque[front]]) {sol=a[deque[front]];init=j-k+1;bestk=k;}
}
}
out<<init<<" "<<init+bestk-1<<" "<<sol;
return 0;}