Pagini recente » Cod sursa (job #636259) | Cod sursa (job #1860176) | Cod sursa (job #2862766) | Cod sursa (job #453868)
Cod sursa(job #453868)
#include<iostream.h>
#include<conio.h>
int v[20] , l[20] , n , i , k , max , t;
int main()
{
clrscr();
cin>>n;
for(i = 1 ; i <= n ; i++)
cin>>v[i];
l[n] = 1;
for(k = n - 1 ; k >= 1 ; k--)
{
max = 0;
for(i = k + 1 ; i <= n ; i++)
if(v[i] >= v[k] && l[i] > max)
max = l[i];
l[k] = 1 + max;
}
max = l[1];
t = 1;
for(k = 1 ; k <= n ; k++)
if(l[k] > max)
{
max = l[k];
t = k;
}
cout<<"lungimea maxima este "<<max<<endl<<v[t]<<" ";
for(i = t + 1 ; i <= n ; i++)
if(v[i] > v[t] && l[i] == max - 1)
{
cout<<v[i]<<" ";
max--;
}
getch();
return 0;
}