Cod sursa(job #1504982)

Utilizator Julian.FMI Caluian Iulian Julian. Data 18 octombrie 2015 17:01:18
Problema Secventa Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.57 kb
#include <iostream>
#include <fstream>
#define nmax 500005
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int maxim,inc,dq[nmax],poz[nmax];

int main()
{long in,sf,k,d,i,x,n;
    fin>>n>>k;
    sf=-1;in=0;

    maxim=-30999;inc=0;

    for(i=1;i<=n;i++)
        {fin>>x;

         while(sf>=in && x<dq[sf])sf--;
         dq[++sf]=x;poz[sf]=i;
        if(i>=k)
            if(dq[in]>maxim)
                {maxim=dq[in];inc=poz[in];}
        if(i-poz[in] >= k-1)in++;
        }

    fout<<inc<<' '<<inc+k-1<<' '<<maxim;

}