Pagini recente » Cod sursa (job #1209203) | Cod sursa (job #2838653) | Cod sursa (job #1151713) | Cod sursa (job #1542434) | Cod sursa (job #2506719)
#include <fstream>
using namespace std;
int main()
{
ifstream fin ("secventa.in");
ofstream fout ("secventa.out");
int n,k,x,d[1000001],v[1000001],u=1,p=1,bmax=-31000,umax=6;
fin>>n>>k;
for (int i=1;i<=n;i++)
fin>>v[i];
d[1]=1;
for (int i=2;i<=n;i++)
{
while (v[i]<=v[d[u]]&&u>=p)
u--;
u++;
d[u]=i;
if (d[p]<=i-k)
p++;
if (i>=k)
if (bmax<v[d[p]])
{
bmax=v[d[p]];
umax=d[p];
}
}
fout<<umax<<" "<<umax+k-1<<" "<<bmax;
return 0;
}