Pagini recente » Cod sursa (job #424984) | Cod sursa (job #1372120) | Cod sursa (job #123866) | Cod sursa (job #984180) | Cod sursa (job #2138900)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");
int n,a[100010],dp[100010],lungime,inceput;
int main()
{
fi>>n;
for(int i=1;i<=n;i++)
fi>>a[i];
dp[1]=1;
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++)
if(a[j]<a[i])
{
dp[i]=max(dp[i],dp[j]+1);
}
}
for(int i=1;i<=n;i++)
{
if(dp[i]>lungime)
{
lungime=dp[i];
inceput=1;
}
}
fo<<lungime<<endl;
for(int i=inceput;i<=inceput+lungime;i++)
{
fo<<a[i]<<" ";
}
fi.close();
fo.close();
return 0;
}