Pagini recente » Cod sursa (job #272009) | Cod sursa (job #33555) | Cod sursa (job #1055722) | Cod sursa (job #2714375) | Cod sursa (job #2575083)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("scmax.in");
ofstream fo("scmax.out");
int n, v[100001], l[100001], p[100001];
int main()
{
fi>>n;
for(int i=1;i<=n;i++){
fi>>v[i];
p[i]=i;
l[i]=1;
}
l[n]=1;
int pozmax=n;
for(int i=n-1;i>0;i--)
{
for(int j=i+1;j<=n;j++)
{
if(v[j]>v[i])
{
if(l[i]<l[j]+1)
{
l[i]=l[j]+1;
p[i]=j;
}
}
}
if(l[i]>l[pozmax])
pozmax=i;
}
fo<<l[pozmax]<<'\n';
while(p[pozmax]!=pozmax)
{
fo<<v[pozmax]<<" ";
pozmax=p[pozmax];
}
fo<<v[pozmax];
fi.close();
fo.close();
return 0;
}