Pagini recente » Borderou de evaluare (job #888920) | Cod sursa (job #2411009) | Cod sursa (job #644303) | Cod sursa (job #659561) | Cod sursa (job #2507135)
#include <fstream>
#include <cstdio>
using namespace std;
int d[500001],v[500001];
int main()
{
freopen ("secventa.in","r",stdin);
ofstream fout ("secventa.out");
int n,k,x,u=1,p=1,bmax=-31000,umax=6;
scanf("%d%d", &n,&k);
for (int i=1;i<=n;i++)
scanf("%d", &v[i]);
d[1]=1;
for (int i=2;i<=n;i++)
{
while (v[i]<=v[d[u]]&&u>=p)
u--;
u++;
d[u]=i;
if (d[p]<=i-k)
p++;
if (i>=k)
if (bmax<v[d[p]])
{
bmax=v[d[p]];
umax=i;
}
}
fout<<umax-k+1<<" "<<umax<<" "<<bmax;
return 0;
}