Pagini recente » Borderou de evaluare (job #1846518) | Hărți | Cod sursa (job #2371644) | Borderou de evaluare (job #2847877) | Cod sursa (job #2204697)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n,k,i,p,u,d[500010],v[500010],m,st,dr;
int main(){
fin>>n>>k;
m=-300010;
for(i=1;i<=n;i++)
fin>>v[i];
p=1;u=1;
d[1]=1;
for(i=2;i<=n;i++){
while(v[i]<v[d[u]] && u>=p){
u--;
}
d[++u]=i;
if(i-d[p]==k)
p++;
if(i>=k){
if(v[d[p]]>m){
st=d[u]-k+1;
dr=d[u];
m=v[d[p]];
}
}
}
fout<<st<<" "<<dr<<" "<<m;
return 0;
}