Pagini recente » Cod sursa (job #1133957) | Cod sursa (job #571430) | Cod sursa (job #1532066) | Cod sursa (job #1461931) | Cod sursa (job #1857348)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,lmax,p,l[100001], a[100001];
void citire(int &n)
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
void dinamica()
{
int max;
l[n]=1;
for(int i=n-1;i>=1;i--)
{
max=0;
for(int j=i+1;j<=n;j++)
if(l[j]>max && a[i]<a[j])
max=l[j];
l[i]=max+1;
if(lmax<l[i])
lmax=l[i];
}
}
void drum()
{
int t=0;
p=1;
g<<lmax<<'\n';
do{
while(l[p]!=lmax || a[t]>a[p])
p++;
g<<a[p]<<" ";
t=p;
lmax--;
}while(lmax);
}
int main()
{
citire(n);
dinamica();
drum();
}