Pagini recente » Istoria paginii runda/night_time_contest3 | Istoria paginii utilizator/vladutbercovici | Cod sursa (job #372956) | Istoria paginii utilizator/stahlhelm | Cod sursa (job #2046189)
#include <bits/stdc++.h>
using namespace std;
const int N = 500001;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,m,i,j,v[N],k,d[N],st,dr,mx=-30000,a,b;
int main()
{
fin>>n>>k;
st=0;
dr=-1;
for(i=0; i<n; i++)
{
fin>>v[i];
if(st<=dr && d[st] == i-k)
st++;
while(st<=dr && v[i]<=v[d[dr]])
{
dr--;
}
d[++dr] = i;
if(i>=k-1&&v[d[st]] > mx)
{
mx=v[d[st]];
a = i - k + 2;
b = i + 1;
}
}
fout<<a<<" "<<b<<" "<<mx;
return 0;
}