Pagini recente » Cod sursa (job #1904286) | Cod sursa (job #1061113) | Cod sursa (job #2662150) | Cod sursa (job #2590307) | Cod sursa (job #1261464)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int v[500001],d[500001],i,n,j,u,p,minim,nr,k,ii,jj;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>v[i];
}
nr=-4000000;
d[1]=1;u=1;p=1;
for(i=2;i<=n;i++){
while(p<=u && v[i]<v[d[u]]){
u--;
}
d[++u]=i;
if(d[p]==i-k){
p++;
}
if(i>=k && v[d[p]]>nr){
nr=v[d[p]];
ii=i-k+1;
}
}
fout<<ii<<" "<<ii+k-1<<" "<<nr<<"\n";
return 0;
}