Pagini recente » Monitorul de evaluare | Cod sursa (job #1639255) | Cod sursa (job #1551690) | Cod sursa (job #2682291) | Cod sursa (job #2068159)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream c("scmax.out");
int main()
{
int n,a[1000],S[1000],p[1000];
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
int k,Lmax=0;
for(int i=1;i<n;i++){
p[0]=a[i];
k=0;
for(int j=i+1;j<=n;j++){
if(p[k]<a[j]){
p[k+1]=a[j];
k++;
}
}
if(k+1>Lmax){
Lmax=k+1;
for(int l=0;l<Lmax;l++)
S[l]=p[l];}
}
c<<Lmax<<endl;
for(int l=0;l<Lmax;l++)
c<<S[l]<<" ";
return 0;
}