Pagini recente » Cod sursa (job #2423589) | Cod sursa (job #1506830) | Cod sursa (job #1993130) | Cod sursa (job #1945427) | Cod sursa (job #2384275)
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
int l[100001], poz[100001], n;
long long int v[100001];
int main()
{
fin>>n;
for(int i=1; i<=n;i++)
{
fin>>v[i];
}
l[n]=1; poz[n]=-1; int maxim=0, p=0;
for(int i=n-1; i>=1; i--)
{
poz[i]=-1; l[i]=1;
for(int j=i+1; j<=n; j++)
{
if(v[i]<v[j] && l[i]<l[j]+1)
{
l[i]=l[j]+1;
if(l[i]>maxim)
{
maxim=l[i];
p=i;
}
poz[i]=j;
}
}
}
fout<<maxim<<"\n";
int i=p;
fout<<v[p]<<" ";
while(poz[i]!=-1)
{
i=poz[i];
fout<<v[i]<<" ";
}
return 0;
}