Cod sursa(job #1801837)

Utilizator stefanchistefan chiper stefanchi Data 9 noiembrie 2016 17:30:17
Problema Secventa Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.02 kb
#include <cstdio>
#include <deque>
#define Nmax 500010
using namespace std;
deque < int > deq;
int maxim;
int vec[Nmax];
int n,k;
void read()
{
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    scanf("%d %d",&n,&k);
    for(int i = 1 ; i < k ; i++)
    {
        scanf("%d ",&vec[i]);
        while(!deq.empty() && vec[deq.back()] >= vec[i])
            deq.pop_back();
        deq.push_back(i);
    }
    maxim = deq.front();
    for(int i = k ; i <= n ; i++)
    {
        scanf("%d ",&vec[i]);
        if(!deq.empty() && deq.front() <= i - k )
            deq.pop_front();
        while(!deq.empty() && vec[deq.back()] >= vec[i])
            deq.pop_back();
        deq.push_back(i);
        if(vec[deq.front()] > vec[maxim])
            maxim = deq.front();
    }
}

int main()
{
    read();
    if(maxim -1 - k > -1)
        printf("%d %d %d",maxim - k +1, maxim ,vec[maxim]);
    else
        printf("%d %d %d",maxim  , maxim  + k - 1, vec[maxim]);
    return 0;
}