Pagini recente » Cod sursa (job #560364) | Clasament Junior Challenge 2015 | Cod sursa (job #2540696) | Cod sursa (job #3295023) | Cod sursa (job #514453)
Cod sursa(job #514453)
#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 adauga(int i)
{
dq[++dr]=i;
}
void stanga(int i)
{
if(dq[st]==i)
++st;
}
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
int i,poz1,poz2,max;
in>>n>>k;
for(i=1;i<=n;i++)
in>>v[i];
st=1;
dr=0;
max=-40000;
for(i=1;i<=k;i++)
{
dreapta(i);
dq[++dr]=i;
}
for(;i<=n;i++)
{
dreapta(i);
adauga(i);
stanga(i-k);
if (v[dq[st]]>max)
{
max=v[dq[st]];
poz1=i-k+1;
poz2=i;
}
}
out<<poz1<<" "<<poz2<<" "<<max<<"\n";
return 0;
}