Pagini recente » Cod sursa (job #850545) | Cod sursa (job #902240) | Cod sursa (job #2774162) | Cod sursa (job #1891798) | Cod sursa (job #2206847)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, i, j, k, v[500010], d[500010], x, p, u, st, dr, maxim;
int main(){
maxim=-20000000;
fin>>n>>k;
d[1]=1;
p=1;
u=1;
for(i=1; i<=n; i++){
fin>>v[i];
}
for(i=2; i<=n; i++){
while(p<=u && v[i]<v[d[u]]){
u--;
}
u++;
d[u]=i;
if(i-d[p]==k){
p++;
}
if(i>=k && maxim<v[d[p]]){
maxim=v[d[p]];
st=d[u]-k+1;
dr=d[u];
}
}
fout<<st<<" "<<dr<<" "<<maxim;
}