Pagini recente » Cod sursa (job #1657669) | Cod sursa (job #2764967) | Cod sursa (job #824818) | Cod sursa (job #2207864) | Cod sursa (job #2106459)
#include<iostream>
#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
//ifstream f("grupuri.in");
//ofstream g("grupuri.out");
int i,n,c,k,maxim,v[500001],poz;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++)
{
c++;
if(c==k)
{
if(v[i-c+1]>maxim)
{
maxim=v[i-c+1];
poz=i;
}
c--;
}
}
for(i=poz-k+1;i<=poz;i++)
cout<<v[i]<<" ";
}