Pagini recente » Cod sursa (job #2365621) | Cod sursa (job #1331789) | Cod sursa (job #2173967) | Cod sursa (job #198348) | Cod sursa (job #1222098)
//horatiu11
# include <cstdio>
# include <deque>
using namespace std;
int n,k,a[500001],pm,pM,M;
deque <int>d;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i)
{
scanf("%d",&a[i]);
while(!d.empty() && a[d.back()]>a[i])
d.pop_back();
d.push_back(i);
if(d.front()==i-k)
d.pop_front();
if(i>=k && !d.empty())
if(M<a[d.front()])
{
M=a[d.front()];
pm=d.front();
pM=i;
}
}
printf("%d %d %d\n",pm,pM,M);
return 0;
}