Pagini recente » Cod sursa (job #1182636) | Cod sursa (job #3277713) | 120n | Cod sursa (job #623369) | Cod sursa (job #1827245)
#include <fstream>
using namespace std;
int v[100005],k[100005],p[100005],i,n,j,maxi,maxiind;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
fin>>n;maxi=0;
for( i = 1; i <= n; i++)
{
fin>>v[i];
}
for( i = n-1 ; i>=0;i--)
{
for(j=i+1; j <= n; j++)
{
if(v[i]<v[j] && k[j]>=maxi)
{
k[i]=k[j]+1;
maxi=k[j];
p[i]=j;
maxiind=j;
}
}
}
fout<<maxi+1<<'\n';
i=maxiind;
while(i!=0)
{
fout<<v[i]<<" ";
i=p[i];
}
return 0;
}