Pagini recente » Cod sursa (job #2686901) | Cod sursa (job #1072060) | Cod sursa (job #3269514) | Cod sursa (job #1052481) | Cod sursa (job #1386526)
#include<fstream>
using namespace std;
int N,K,a[500050],d[500050],ind;
int main()
{
ifstream fin("secventa.in");
ofstream fout("secventa.out");
fin>>N>>K;
for(int i=1;i<=N;++i)
fin>>a[i];
int f=1;
int b=0;
int ma=-30001;
for(int i=1;i<=N;++i)
{
while((f<=b)&&(a[i]<=a[d[b]]))
--b;
++b;
d[b]=i;
if(d[f]==i-K)
++f;
if(i>=K)
if(a[d[f]]>ma)
{
ma=a[d[f]];
ind=i;
}
}
fout<<ind-K+1<<" "<<ind<<" "<<ma;
return 0;
}