Pagini recente » Cod sursa (job #362001) | Cod sursa (job #2025822) | Cod sursa (job #1834842) | Cod sursa (job #742778) | Cod sursa (job #808800)
Cod sursa(job #808800)
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, lgmax[100005], urm[100005], a[100005];
void citire();
void pd();
void afisare();
int main()
{
citire();
pd();
afisare();
return 0;
}
void citire()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
}
void pd()
{
int i, j;
//initializare
lgmax[n]=1; urm[n]=-1;
for(i=n-1;i>=1;i--)
{//calculez lgmax[i]
lgmax[i]=1; urm[i]=-1;
for(j=i+1;j<=n;j++)
if(a[i]<a[j]&&lgmax[i]<1+lgmax[j])
{
lgmax[i]=1+lgmax[j]; urm[i]=j;
}
}
}
void afisare()
{
int i, max, pozmax;
max=lgmax[1]; pozmax=1;
for(i=2;i<=n;i++)
if(max<lgmax[i])
{
max=lgmax[i]; pozmax=i;
}
fout<<max<<'\n';
//scriu si solutia
i=pozmax;
while(i!=-1)
{
fout<<a[i]<<' ';
i=urm[i];
}
}