Cod sursa(job #1354019)
Utilizator | Data | 21 februarie 2015 15:12:50 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int v[500001];
int main()
{long n,k;
int i,max=-31000,im;
f>>n>>k;
for(i=1;i<=n;i++) {f>>v[i];
if(v[i]>max)
{max=v[i];
im=i;
}
}
if(im<=n-k+1)
{for(i=im;i<=n;i++)
g<<v[i]<<' ';
}
else {for(i=n-k+1;i<=n;i++)
g<<v[i]<<' ';
}
return 0;
}