Cod sursa(job #2741010)

Utilizator hhhhhhhAndrei Boaca hhhhhhh Data 15 aprilie 2021 10:19:00
Problema Secventa Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.52 kb
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,v[500005],st[500005],dr[500005],maxim=-1e6,l,r;
string s;
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fout.tie(0);
    fin>>n>>k;
    fin.get();
    getline(fin,s);
    int semn=1;
    int poz=0;
    int nr=0;
    for(int i=0;i<s.size();i++)
    {
        if(s[i]=='-')
            semn*=-1;
        if(isdigit(s[i]))
            nr=nr*10+(s[i]-'0');
        if(s[i]==' '||i+1==s.size())
        {
            nr*=semn;
            v[++poz]=nr;
            nr=0;
            semn=1;
        }
    }
    st[1]=1;
    deque<int> coada;
    coada.push_back(1);
    for(int i=2;i<=n;i++)
    {
        while(!coada.empty()&&v[coada.back()]>=v[i])
            coada.pop_back();
        if(coada.empty())
            st[i]=1;
        else
            st[i]=coada.back()+1;
        coada.push_back(i);
    }
    coada.clear();
    dr[n]=n;
    for(int i=n;i>=1;i--)
    {
        while(!coada.empty()&&v[coada.back()]>=v[i])
            coada.pop_back();
        if(coada.empty())
            dr[i]=n;
        else
            dr[i]=coada.back()-1;
        coada.push_back(i);
    }
    for(int i=1;i<=n;i++)
        if(dr[i]-st[i]+1>=k)
            if(maxim<v[i])
            {
                maxim=v[i];
                l=st[i];
                r=max(i,st[i]+k-1);
            }
    fout<<l<<" "<<r<<" "<<maxim;
    return 0;
}