Cod sursa(job #916642)
Utilizator | Data | 16 martie 2013 19:04:03 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int main()
{
int v[100],N,K,i,j,k,max;
ifstream f("secventa.in");
ofstream g("secventa.out");
max=-30000;
f>>N;
f>>K;
for(i=1;i<=N;i++)
{
f>>v[i];
}
for(i=1;i<=N;i++)
{
if(v[i]>max&&N-i>=K-1)
{
max=v[i];
k=i;
}
}
for(j=k;j<=N;j++)
{
g<<v[j]<<" ";
}
}