Pagini recente » Cod sursa (job #1465750) | Cod sursa (job #2233911) | Cod sursa (job #2297635) | Rating Turbo bagaciosu (bagaciosu) | Cod sursa (job #2607664)
#include <fstream>
#define NMAX 100005
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,d[NMAX],x,cntr=0,maxi,poz[NMAX],k,start;
long long int v[NMAX],sol[NMAX];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
d[1]=1; poz[1]=0; maxi=1; start=1;
for(int i=2;i<=n;i++)
{
for(int j=1;j<i;j++)
{
if(v[i]>v[j] && 1+d[j]>d[i])
d[i]=d[j]+1,k=j;
}
if(d[i]==0)
d[i]=1;
else
{
if(d[i]>maxi)
maxi=d[i],start=i;
poz[i]=k;
}
}
fout<<maxi<<'\n';
while(start!=0)
{
sol[++cntr]=v[start];
start=poz[start];
}
for(int i=cntr;i>=1;i--)
fout<<sol[i]<<' ';
fout<<'\n';
return 0;
}