Pagini recente » Cod sursa (job #2765798) | Cod sursa (job #1565318) | Cod sursa (job #1283880) | Cod sursa (job #1808201) | Cod sursa (job #1878315)
#include <iostream>
#include <fstream>
#define N 500010
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int i,j,n,m,k,l,a[N],deq[N];
int baz=30001;
int main()
{
int frnt,bck;
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
frnt=1;
bck=0;
for(i=1;i<=n;i++)
{
while(frnt<=bck && a[i]<=a[deq[bck]])
bck--;
deq[++bck]=i;
if(deq[frnt]<=i-k)
frnt++;
}
for(i=frnt;i<=bck;i++)
baz=min(a[deq[i]],baz);
g<<deq[frnt]<<' '<<deq[bck]<<' '<<baz;
}