Pagini recente » Borderou de evaluare (job #1798049) | Cod sursa (job #303443) | Cod sursa (job #897801) | Cod sursa (job #2152408) | Cod sursa (job #1506190)
//cel mai lung subsir crescator
#include <fstream>
using namespace std;
int n,m,i,j,maxi,p,a[100005],v[100005],pred[100005];
ifstream f("scmax.in");
ofstream g("scmax.out");
void afis(int x)
{
if(x!=0)
{
g<<v[x]<<" ";
afis(pred[x]);
}
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
a[n]=1;
for(i=n-1; i>=1; i--)
{
maxi=0;
for(j=i+1; j<=n; j++)
if(v[i]<v[j]&&a[j]>maxi)
{
maxi=a[j];
pred[i]=j;
}
a[i]=maxi+1;
}
maxi=0;
for(i=1; i<=n; i++)
if(a[i]>maxi)
{
maxi=a[i];
p=i;
}
g<<maxi<<endl;
afis(p);
return 0;
}