Pagini recente » Cod sursa (job #595267) | Cod sursa (job #511114) | Cod sursa (job #518474) | Cod sursa (job #529407) | Cod sursa (job #2115511)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int A[1000],L[1000],P[1000],n,x,mx;
int main(){
ifstream cin("scmax.in");
ofstream cout("scmax.out");
cin>>n;
for(int i=0;i<n;i++){
cin>>A[i];
L[i]=1;
P[i]=-1;
}
for(int i=1;i<n;i++){
for(int j=0;j<i;j++){
if(A[i]>A[j] && L[i]<L[j]+1){
L[i]=L[j]+1;
P[i]=j;
if(L[i]>mx){
mx=L[i];
x=i;
}
}
}
}
int i=x;
cout<<mx<<"\n";
while(i!=-1){
cout<<A[i]<<" ";
i=P[i];
}
return 0;
}