Pagini recente » Cod sursa (job #496435) | Cod sursa (job #755380) | Cod sursa (job #89912) | Cod sursa (job #2882690) | Cod sursa (job #1754983)
#include<fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,maxs=-30001,p,u,coada[500001],v[500001],st,fi;
int main(){
fin>>n>>k;
for (i=1;i<=n;i++)
fin>>v[i];
fin.close();
p=1;u=0;
for (i=1;i<=n;i++){
while(p<=u && v[coada[u]]>v[i]) u--;
u++;
coada[u]=i;
if (i-coada[p]>=k) p++;
if (i>=k && maxs<v[coada[p]]){
if (i-coada[p]<k-1){
st=i-k+1;
fi=i;
maxs=v[coada[p]];
}
else{
st=coada[p];
fi=i;
maxs=v[coada[p]];
}
}
}
fout<<st<<" "<<fi<<" "<<maxs;
fout.close();
return 0;
}