Pagini recente » Cod sursa (job #817992) | Cod sursa (job #1912599) | Cod sursa (job #2981064) | Cod sursa (job #1198467) | Cod sursa (job #2261699)
#include <fstream>
using namespace std;
ifstream fin("sclm.in");
ofstream fout("sclm.out");
#define MAXN 100001
int v[MAXN],a[MAXN],n,maxi;
int rez(){
int i,j;
a[n]=1;
for(i = n-1; i > 0; i--){
a[i] = 1;
for(j = i+1; j <= n; j++)
if(a[i] < a[j]+1 && v[i] < v[j])
a[i] = a[j]+1;
if(a[i] > maxi)
maxi = a[i];
}
}
void afis(){
fout<<maxi<<'\n';
while(maxi)
{for(int i=1;i<=n;i++)
if(a[i]==maxi){
fout<<v[i]<<' ';
maxi--;
}
}
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
rez();
afis();
return 0;
}