Pagini recente » Cod sursa (job #2738659) | Cod sursa (job #2126151) | Cod sursa (job #1642638) | Cod sursa (job #1046137) | Cod sursa (job #2077773)
#include <fstream>
using namespace std;
int n,k,j,y,Max,nr,x,b[500005],a[500005],i;
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
}
Max=-300001;
y=1;
for(i=1;i<=n;i++)
{
while(y<=x && a[i]<a[b[x]])
{
x--;
}
x++;
b[x]=i;
if(b[y]<=i-k)y++;
if(i>=k && a[b[y]]>Max)
{
Max=a[b[y]];
nr=i;
}
}
g<<nr-k+1<<" "<<nr<<" "<<Max<<'\n';
return 0;
}