Pagini recente » Cod sursa (job #2106871) | Monitorul de evaluare | Monitorul de evaluare | Statistici Ivan Gabriel-Marian (gabi31) | Cod sursa (job #1979086)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
int b[500002],a[500002];
int main()
{
int maxim,p=1,u=1,poz,n,k,i;
in>>n>>k;
for (i=1; i<=n; i++)
in>>a[i];
maxim=-30002;
b[p]=1;
for (i=2; i<=n; i++)
{
while (p <= u && a[i] <= a[b[u]])
u--;
b[++u] = i;
while (p <= u && i-b[p] >= k)
p++;
if (a[b[p]] > maxim && i >= k)
{
maxim = a[b[p]];
poz = i;
}
}
out<<poz-k+1<<" "<<poz<<" "<<maxim;
return 0;
}