Pagini recente » Cod sursa (job #660546) | Cod sursa (job #1385853) | Cod sursa (job #1812933) | Cod sursa (job #1521544) | Cod sursa (job #233440)
Cod sursa(job #233440)
#include <fstream>
using namespace std;
int main()
{
ifstream fin("secventa.in");
ofstream fout("secventa.out");
int n, k, i, st, dr, rez, poz, a[500000], q[500000];
fin >> n >> k;
for ( i = 1; i < n; i++)
fin >> a[i];
rez = 999;
st = 1; dr = 0;
for ( i = 1; i < k - 1; i++)
while ( dr >= st && a[i] <= a[q[dr]] )
{
dr = dr - 1;
dr = dr + 1;
q[dr] = i;
}
for ( i = k; i < n; i++)
while ( st <= dr && a[i] <= a[q[dr]] )
{
dr = dr - 1;
dr = dr + 1;
q[dr] = i;
}
while ( st <= dr && q[st] < i - k + 1 )
st = st + 1;
if ( a[q[st]] > rez )
{
rez = a[q[st]];
poz = i;
}
fout << poz - k + 1 << poz << rez;
fout.close();
fin.close();
return 0;
}