Pagini recente » Cod sursa (job #1959677) | Cod sursa (job #3223278) | Cod sursa (job #3186093) | Cod sursa (job #2498793) | Cod sursa (job #2205446)
#include <fstream>
using namespace std;
ifstream in ("secventa.in");
ofstream out ("secventa.out");
int mn[500003],v[500003];
int main()
{
int mxf=-999999999,n,k,i,stn=1,drn=0,pz1,pz2;
in>>n>>k;
for(i=1;i<=n;i++)
{
in>>v[i];
while(drn>=stn && v[i]<=v[mn[drn]])
drn--;
mn[++drn]=i;
if(mn[stn]==i-k)
stn++;
if(v[mn[stn]]>mxf && i>=k)
mxf=v[mn[stn]],pz2=i,pz1=i-k+1;
}
out<<pz1<<' '<<pz2<<' '<<mxf;
return 0;
}