Pagini recente » Cod sursa (job #1675767) | Cod sursa (job #801499) | Cod sursa (job #2769446) | Cod sursa (job #2928379) | Cod sursa (job #1531977)
#include<fstream>
#include<iostream>
using namespace std;
ifstream fin("scmax.in");
ifstream fout("scmax.out");
int v[100], d[100], p[100], n, k;
int main()
{
fin>>n;
for (int i=1;i<=n;i++) fin>>v[i];
int i, j, max, max2=n, poz;
d[n]=1;
p[n]=0;
for (i=n-1; i>=1; i--)
{
poz=0; max=0;
for (j=i+1; j<=n; j++)
if (v[i]<v[j] && d[j]>max)
{
max=d[j];
poz=j;
}
d[i]=1+max;
p[i]=poz;
if (d[i]>d[max2]) max2=i;
}
cout<<"Lungimea maxima este : "<<d[max2]<<endl;
while (max2>0)
{
cout<<v[max2]<<" ";
max2=p[max2];
}
return 0;
}