Cod sursa(job #2938201)
Utilizator | Data | 11 noiembrie 2022 19:33:40 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
long long n,k,a[500001],maxi=0,ifinal=0,jfinal=0;
deque<int> d;
fin>>n>>k;
for(int i=1;i<=n;i++){
fin>>a[i];
while(!d.empty() && a[d.back()]>a[i])
d.pop_back();
if(!d.empty() && d.front()==i-k)
d.pop_front();
d.push_back(i);
if(i>=k && maxi<a[d.front()]){
maxi=a[d.front()];
ifinal=d.front();
jfinal=d.front()+k-1;
}
}
fout<<ifinal<<" "<<jfinal<<" "<<maxi;
return 0;
}