Pagini recente » Cod sursa (job #1344581) | Cod sursa (job #1905954) | Cod sursa (job #1308290) | Cod sursa (job #1553270) | Cod sursa (job #2507132)
#include <fstream>
using namespace std;
int d[500001],v[500001];
int main()
{
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,x,u=1,p=1,bmax=-31000,umax=6;
fin>>n>>k;
for (int i=1;i<=n;i++)
fin>>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;
}