Pagini recente » Cod sursa (job #2846373) | Cod sursa (job #297118) | Cod sursa (job #3239323) | Cod sursa (job #3129687) | Cod sursa (job #2206862)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,a[5000100],d[5000100],p,u,maxim=-100000,poz;
int main(){
fin>>n>>k;
for(i=1;i<=n;i++){
fin>>a[i];
}
p=u=d[1]=1;
for(i=2;i<=n;i++){
while(a[i]<a[d[u]] && p<=u){
u--;
}
u++;
d[u]=i;
if(i- d[p]==k){
p++;
}
if(i>=k && maxim<a[d[p]]){
maxim=a[d[p]];
poz=i;
}
}
fout<<poz-k+1<<" "<<poz<<" "<<maxim;
}