Cod sursa(job #2674064)
| Utilizator | Data | 18 noiembrie 2020 15:55:46 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("secventa.in");
ofstream fout("secventa.out");
vector<int> v;
int n,i,k,p=0,x,maxi=0;
fin>>n>>k;
for(i=0;i<n;i++)
{
fin>>x;
v.push_back(x);
}
for(i=0;i<n;i++)
{
if(v[i]>maxi && i+k<=n)
{
p=i;
maxi=v[i];
}
}
for(i=p;i<p+k;i++)
fout<<v[i]<<" ";
return 0;
}
