Pagini recente » Rating Stoiean Tudor (tudor123) | Cod sursa (job #2279596) | Cod sursa (job #848841) | Cod sursa (job #2270540) | Cod sursa (job #2006268)
#include<fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,i,a[500001],minim,d[500001],u,p,pf;
int main()
{
f>>n>>k;
minim=-30001;
p=u=1;
d[p]=1;
f>>a[1];
for(i=2;i<=n;i++)
{
f>>a[i];
while(i-d[p]>=k&&p<=u)
p++;
while(a[i]<=a [d[u]]&&p<=u)
u--;
u++;
d[u]=i;
if(i>=k)
if(minim<a[d[p]])
{
minim=a[d[p]];
pf=i;
}
}
g<<pf-k+1<<" "<<pf<<" "<<minim;
return 0;
}