Pagini recente » Cod sursa (job #2797136) | Cod sursa (job #2393139) | Cod sursa (job #1035859) | Cod sursa (job #2888415) | Cod sursa (job #1506693)
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,deq[500001],a[500001];
int minim=-30001,p1;
int main()
{
f>>n>>k;
int prim=1,ultim=0;
for(int i=1;i<=n;++i)
{
f>>a[i];
while(prim<=ultim&&a[i]<a[deq[ultim]])
ultim--;
ultim++;
deq[ultim]=i;
if(deq[prim]==i-k)
prim++;
if(i>=k&&minim<a[deq[prim]])
{
minim=a[deq[prim]];
p1=i;
}
}
g<<p1-k+1<<" "<<p1<<" "<<minim;
return 0;
}