Pagini recente » Cod sursa (job #2257460) | Cod sursa (job #1542347) | Cod sursa (job #1585272) | Borderou de evaluare (job #702913) | Cod sursa (job #1724587)
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100000],best[100000],poz[100000],i,j,maxi,p,n;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
best[n]=1;
poz[n]=-1;
maxi=1; p=n;
for(i=n-1;i>=1;--i)
{
best[i]=1;
poz[i]=-1;
for(j=i+1;j<=n;++j)
if(a[i]<a[j] && best[i]<best[j]+1)
{
best[i]=best[j]+1;
poz[i]=j;
if(best[i]>maxi) {maxi=best[i];
p=i;}
}
}
fout<<maxi<<'\n';
i=p;
while(i!=-1)
{
fout<<a[i]<<" ";
i=poz[i];
}
return 0;
}