Pagini recente » Cod sursa (job #2021365) | Cod sursa (job #1338870) | Cod sursa (job #1685209) | Cod sursa (job #1718842) | Cod sursa (job #1753466)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,a[500010],deq[500010],poz[500010],p,i,k,ma=-99999999,j,pozi,pozf;
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
f>>a[i];
deq[1]=a[1];
poz[1]=1;
p=1;
for (i=2;i<=k;i++)
{
if (a[i]<deq[p])
{
while (p>=1 && a[i]<deq[p]) p--;
p++;
deq[p]=a[i];
poz[p]=i;
}
else
{
p++;
deq[p]=a[i];
poz[p]=i;
}
pozi=1;
pozf=k;
ma=deq[1];
}
for (i=k+1;i<=n;i++)
{
if (a[i]<deq[p])
{
while (p>=1 && a[i]<deq[p]) p--;
p++;
deq[p]=a[i];
poz[p]=i;
}
else
{
p++;
deq[p]=a[i];
poz[p]=i;
}
for (j=1;j<=p;j++)
{
if (poz[j]>=i-k+1) { if (deq[j]>ma) {pozf=i;pozi=i-k+1;ma=deq[j];} break;}
}
}
g<<pozi<<" "<<pozf<<" "<<ma;
return 0;
}