Cod sursa(job #2756088)

Utilizator GligarEsterabadeyan Hadi Gligar Data 29 mai 2021 16:38:13
Problema Secventa Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.36 kb
#include <fstream>
#include <queue>
#include <string>

using namespace std;

ifstream fin("secventa.in");
ofstream fout("secventa.out");

const int nmax=500000, inf=(1<<30)-1;

int v[nmax+1];

deque <int> dq;

typedef long long int64;

string s;

void citire(){
    getline(fin,s);
    int semn=1,j=0;
    for(int64 i=0;i<int64(s.size());i++){
        if(s[i]!=' '){
            j++;
        }
        if(s[i]=='-'){
            semn=-1;
            i++;
        }
        int m=0;
        while(s[i]>='0'&&s[i]<='9'){
            m=m*10+s[i]-'0';
            i++;
        }
        m*=semn;
        semn=1;
        v[j]=m;
    }
}

int main(){
    int n,m;
    fin>>n>>m;
    getline(fin,s);
    citire();
    for(int i=1;i<=m-1;i++){
        while(dq.empty()==0&&v[i]<v[dq.back()]){
            dq.pop_back();
        }
        dq.push_back(i);
    }
    int maxi=-inf,maxii=0;
    for(int i=m;i<=n;i++){
        while(dq.empty()==0&&v[i]<v[dq.back()]){
            dq.pop_back();
        }
        dq.push_back(i);
        if(dq.front()<=i-m){
            dq.pop_front();
        }
        if(v[dq.front()]>maxi){
            maxi=v[dq.front()];
            maxii=dq.front();
        }
    }
    fout<<maxii<<" "<<m+maxii-1<<" "<<maxi<<"\n";
    /*for(int i=1;i<=n;i++){
        fout<<v[i]<<" ";
    }*/
    return 0;
}