Pagini recente » Cod sursa (job #1970445) | Cod sursa (job #145577) | Cod sursa (job #2303097) | Cod sursa (job #1287172) | Cod sursa (job #1410953)
#include <iostream>
#include <fstream>
using namespace std;
long long n,k,mx,s,v[500000],p;
int main()
{
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;
for (int i=1;i<=n;i++)
{
f>>v[i];
}
mx=v[1];
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n-k+1;j++)
if (v[j]>mx) {mx=v[i];p=i;}
}
for (int i=p;i<=p+k-1;i++)
{
g<<v[i]<<" ";
}
return 0;
}