Pagini recente » Cod sursa (job #2287061) | Cod sursa (job #786159) | Cod sursa (job #3264641) | Cod sursa (job #681820) | Cod sursa (job #2281299)
#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=0;
cin>>n>>k;
for(;n--;){
cin>>v[++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;
}