Pagini recente » Cod sursa (job #2723305) | Cod sursa (job #69996) | Cod sursa (job #1018790) | Cod sursa (job #2963748) | Cod sursa (job #648021)
Cod sursa(job #648021)
#include <fstream>
using namespace std;
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int N , K , bk ,fr , pos;
short A[500001] , dq[500001] ,bmax = -30005;
int main()
{
fin>>N>>K;
fr = 1; bk = 0;
for(int i = 1;i<=N;++i)
{
fin>>A[i];
while(fr<=bk && A[i] <= A[dq[bk]]) bk--;
dq[++bk] = i;
if(dq[fr] == i - K) fr++;
if(i>=K)
{
if(bmax < A[dq[fr]])
bmax = A[dq[fr]] , pos = dq[fr];
}
}
fout<<pos<<" "<<pos+K-1<<" "<<bmax<<'\n';
return 0;
}