Pagini recente » Cod sursa (job #2292657) | Cod sursa (job #3171598) | Cod sursa (job #232461) | Cod sursa (job #2959697) | Cod sursa (job #1222033)
#include<fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int v[500001],deq[500001],fr,b,n,k,maxi,dr,st;
int main ()
{
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
fr=1;b=0;
for(int i=1;i<=n;i++)
{
while(fr<=b && v[i]<=v[deq[b]])
b--;
deq[++b]=i;
if(deq[fr]==i-k)
fr++;
if(i>=k && v[deq[fr]]>maxi)
{
maxi=v[deq[fr]];st=deq[fr];dr=deq[fr]+k-1;
}
}
g<<st<<" "<<dr<<" "<<maxi;
}