Pagini recente » Cod sursa (job #2466349) | Cod sursa (job #1613865) | Cod sursa (job #2674822) | Cod sursa (job #1971101) | Cod sursa (job #2467055)
#include <fstream>
#include <deque>
using namespace std;
ifstream in("secventa.in");
ofstream out("secventa.out");
deque<int> secventa;
int v[500005];
int main()
{
int n, k;
in>>n>>k;
for(int i=1; i<=n; i++)in>>v[i];
for(int i=1; i<=n; i++)
{
if(secventa.front()<v[i])
{
while(!secventa.empty())
secventa.pop_back();
}
for(int j=i; j<=i+k && i+k<=n; j++)
{
secventa.push_front(v[j]);
}
}
for(int i=1; i<=k; i++)
{
out<<secventa.front()<<" ";
secventa.pop_front();
}
in.close();
out.close();
return 0;
}