Pagini recente » Cod sursa (job #1298374) | Cod sursa (job #295791) | Cod sursa (job #1108429) | Cod sursa (job #2061049) | Cod sursa (job #2281298)
#include <fstream>
std::ifstream cin("secventa.in");
std::ofstream cout("secventa.out");
#define maxn 500005
int v[maxn],dequ[maxn],n,k;
int main()
{
int fr=1,bk=0,ind=0,sol=-55555,i=1;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++){
while(fr<=bk&&v[i]<v[dequ[bk]])
bk--;
dequ[++bk]=i;
if(i-k==dequ[fr])
fr++;
if(i>=k&&sol<v[dequ[fr]])
sol=v[dequ[fr]],ind=dequ[bk]-k+1;
}
cout<<ind<<' '<<ind+k-1<<' '<<sol;
return 0;
}