Cod sursa(job #1410953)
| Utilizator | Data | 31 martie 2015 12:53:40 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#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;
}
