Pagini recente » Cod sursa (job #1644174) | Cod sursa (job #398856) | Cod sursa (job #2481593) | Cod sursa (job #1454517) | Cod sursa (job #529821)
Cod sursa(job #529821)
#include <fstream>
using namespace std;
ifstream in ("secventa.in");
ofstream out("secventa.out");
const int N=500005;
int v[N],dq[N],n,k,st,dr;
void dreapta(int i)
{
while(st<=dr && v[dq[dr]]>=v[i])
--dr;
}
void stanga(int i)
{
if(i-dq[st]==k)
++st;
}
int main()
{
int i,poz1,poz2,max1;
in>>n>>k;
for(i=1;i<=n;i++)
in>>v[i];
st=1;
dr=0;
for(i=1;i<=k;i++)
{
dreapta(i);
dq[++dr]=i;
}
max1=v[dq[st]];
poz1=1;
poz2=k;
for(;i<=n;i++)
{
stanga(i);
dreapta(i);
dq[++dr]=i;
if (v[dq[st]]>max1)
{
max1=v[dq[st]];
poz1=i-k+1;
poz2=i;
}
}
out<<poz1<<" "<<poz2<<" "<<max1<<"\n";
return 0;
}