Cod sursa(job #794374)
Utilizator | Data | 6 octombrie 2012 11:36:23 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.01 kb |
#include<fstream>
using namespace std;
int main()
{
int n,b,a[100],urm[100],l[100],i,j;
ifstream cin ("scmax.in");
ofstream cout("scmax.out");
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=n;i>=1;i--)
for(j=n;j>i;j--)
{
if(a[i]<a[j]&&l[i]<l[j]+1)
{
l[i]=l[j]+1;
urm[i]=j;}
}
for(i=1;i<=n;i++)
{
cout<<a[urm[i]]<<" ";
}
return 0;
}