Pagini recente » Cod sursa (job #2550346) | Cod sursa (job #2590376) | Cod sursa (job #3178536) | Cod sursa (job #2260561) | Cod sursa (job #2165480)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,m,Max,p,i,j,best[100001],poz[100001],a[100001];
void citire()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
}
void constr()
{
Max=1;
best[n]=1;
poz[n]=-1;
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]>Max){Max=best[i]; p=i;}
}
}
}
}
void afisare()
{
g<<Max<<'\n';
i=p;
while(i!=-1)
{
g<<a[i]<<" ";
i=poz[i];
}
}
int main()
{
citire();
constr();
afisare();
return 0;
}