Pagini recente » Cod sursa (job #1656416) | Cod sursa (job #1528460) | Cod sursa (job #3000938) | Cod sursa (job #3211858) | Cod sursa (job #1765686)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sir.in");
int a[101],l[101],p[101],n,MAX=1,ind;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
l[n]=1;p[n]=-1;
for(int i=n-1;i>=1;i--)
{
for(int j=i+1;j<=n;j++)
if(a[i]<=a[j] && l[j]+1>l[i])
{
l[i]=l[j]+1;
p[i]=j;
}
if(l[i]>MAX)
{
ind=i;
MAX=l[i];
}
}
int i=ind;
cout<<a[ind]<<' ';
while(p[i]!=-1)
{
cout<<a[p[i]]<<' ';
i=p[i];
}
return 0;
}