Pagini recente » Cod sursa (job #2678266) | Cod sursa (job #1987458) | Cod sursa (job #3211723) | Cod sursa (job #529208) | Cod sursa (job #2281313)
#include <fstream>
#include <deque>
std::ifstream cin("secventa.in");
std::ofstream cout("secventa.out");
#define maxn 500005
int v[maxn],n,k;
std::deque<int> dequ;
int main()
{
int ind,sol=-55555,i;
cin>>n>>k;
for(i=1;i<=n;i++){
cin>>v[i];
while(!dequ.empty()&&v[i]<v[dequ.back()])
dequ.pop_back();
dequ.push_back(i);
if(i-k==dequ.front())
dequ.pop_front();
if(i>=k&&sol<v[dequ.front()])
sol=v[dequ.front()],ind=dequ.back();
}
cout<<ind-k+1<<' '<<ind<<' '<<sol;
return 0;
}