Pagini recente » Cod sursa (job #2544064) | Cod sursa (job #332994) | Istoria paginii runda/simulare_oji_09_03_2023/clasament | Cod sursa (job #1069148) | Cod sursa (job #2059189)
#include <fstream>
using namespace std;
int N = 500001;
ifstream in("secventa.in");
ofstream out("secventa.out");
int main()
{
int st=0,dr=-1,i,rez,n,k,v[N],d[N],bax = -30000,poz,poz1;
in >> n >> k;
for(i=0;i<=n;i++){
in >> v[i];
if(st<=dr && d[st] == i-k){
st++;
}
while(st <=dr && v[i] <= d[dr]){
dr--;
}
d[++dr] = i;
if(i >= k-1 && v[d[st]] > bax){
bax= v[d[st]];
poz = i+1;
poz1 = i-k+2;
}
}
out << poz1 << " " << poz << " " << bax;
return 0;
}