Pagini recente » Cod sursa (job #2946510) | Cod sursa (job #1341115) | Cod sursa (job #2303643) | Cod sursa (job #3177405) | Cod sursa (job #2115516)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int A[1000],L[1000],P[1000],n,x,mx,p;
void scrie(int p){
if(p!=-1){
scrie(P[p]);
fout<<A[p]<<" ";
}
}
int main(){
fin>>n;
for(int i=0;i<n;i++){
fin>>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;
}
}
}
}
p=x;
fout<<mx<<"\n";
scrie(p);
return 0;
}