Pagini recente » Cod sursa (job #994051) | Cod sursa (job #523740) | Cod sursa (job #426520) | Cod sursa (job #463948) | Cod sursa (job #2704083)
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
const int NMAX=100005;
int lung[NMAX],k;
int v[NMAX],last[NMAX],sol[NMAX];
int main()
{
int n,i,kon=0,maxi=-1,j,copie,m,t=0;
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=1; i<=n; i++)
{
lung[i]=1;
kon=0;
for(j=1; j<i; j++)
{
if(v[j]<v[i] && lung[j]>=lung[i])
{
lung[i]=lung[j]+1;
last[i]=j;
}
}
if(lung[i]>maxi)
{
maxi=lung[i];
copie=i;
}
}
fout <<maxi<<"\n";
while(copie!=0)
{
t++;
sol[t]=copie;
copie=last[copie];
}
for(int m=maxi; m>=1; m--)
fout<<v[sol[m]]<<" ";
return 0;
}