Pagini recente » Cod sursa (job #192459) | Cod sursa (job #2521651) | Cod sursa (job #2174947) | Cod sursa (job #106284) | Cod sursa (job #2999449)
#include <iostream>
#include <fstream>
using namespace std;
int a[500001],q[500001];
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int main()
{
int n,k,i,pq=0,uq=-1,mx=-1000000000,i1=0,i2=0;
fin>>n>>k;
for(i=1;i<k;i++)
{
fin>>a[i];
while(pq<=uq && a[i]<a[q[uq]])uq--;
q[++uq]=i;
}
for(i=k;i<=n;i++)
{
fin>>a[i];
while(pq<=uq && a[i]<a[q[uq]])uq--;
q[++uq]=i;
if(q[pq]==i-k)pq++;
if(a[q[pq]]>mx)
{
mx=a[q[pq]];
i1=q[pq];
i2=i1+k-1;
}
}
fout<<i1<<" "<<i2<<" "<<mx;
return 0;
}