Pagini recente » Cod sursa (job #3191568) | Cod sursa (job #247923) | Cod sursa (job #750146) | Cod sursa (job #1698979) | Cod sursa (job #1529907)
#include <fstream>
#define lng 100000
#include <stack>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[lng];
int b[lng]={0};
stack <int> S;
int main()
{
int n;
fin>>n;
for(int i=0;i<n;i++)
fin>>a[i];
int max1;
int max2=0;
b[0]=1;
for(int i=0;i<n;i++)
{
max1=1;
for(int j=i-1;j>0;j--)
{
if(a[j]<a[i])
{
if(b[j] + 1 > max1)
{
max1=b[j] + 1;
}
}
}
b[i]=max1;
if(max1>max2) max2=max1;
}
int copmax=max2;
for(int i=n-1;i>=0;i--)
if(b[i]==copmax)
{
S.push(a[i]);
copmax--;
}
fout<<max2<<"\n";
while(S.size())
{
fout<<S.top()<<" ";
S.pop();
}
fin.close();
fout.close();
return 0;
}