Pagini recente » Cod sursa (job #204542) | Cod sursa (job #2193266) | Cod sursa (job #1310933) | Cod sursa (job #2225084) | Cod sursa (job #2127606)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n , k , j , inc ,maxim,poz,finl,b[500005],a[500005],i,semn;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
maxim = -300001;
inc = 1;
for( i = 1 ; i <= n ;i++)
{
while( inc <= finl && a[i] < a[b[finl]])
{
finl--;
}
finl++;
b[finl] = i;
if( b[inc] <= i-k)
inc++;
if( i >= k && a[b[inc]] > maxim)
{
maxim = a[b[inc]];
poz = i;
}
}
fout << poz-k+1 << " " << poz << " " << maxim;
return 0;
}