Pagini recente » Cod sursa (job #2045113) | Cod sursa (job #2265980) | Cod sursa (job #1942291) | Cod sursa (job #166148) | Cod sursa (job #738799)
Cod sursa(job #738799)
#include<cstdio>
using namespace std;
int n,k,maxi,x,y,i,p,u,d[500002],a[500002];
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
scanf("%d",&n);
scanf("%d",&k);
p=1;
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
while(a[i]<=a[d[u]]&&u>0&&p<=u) u--;
u++;
d[u]=i;
if(i-d[p]+1>k) p++;
if(i>=k&&a[d[p]]>maxi)
{
maxi=a[d[p]];
x=i-k+1;
y=i;
}
}
printf("%d %d %d\n",x,y,maxi);
return 0;
}