Pagini recente » Cod sursa (job #263662) | Cod sursa (job #3235622) | Cod sursa (job #3226204) | Cod sursa (job #3243781) | Cod sursa (job #1261460)
#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(i-d[p]==k){
p++;
}
if(i>=k){
minim=v[d[p]];
}
if(minim>nr){
nr=minim;
ii=d[p];
jj=d[u];
}
}
fout<<ii<<" "<<jj<<" "<<nr<<"\n";
return 0;
}