Pagini recente » Cod sursa (job #458351) | Cod sursa (job #882469) | Cod sursa (job #323069) | Cod sursa (job #2811438) | Cod sursa (job #1054681)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int l[100001], urm[100001], v[100001], n, i, maxi, p, j;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>v[i];
urm[n]=0;
l[n]=1;
for(i=n-1;i>=1;i--)
{
maxi=0;
p=0;
for(j=i+1;j<=n;j++)
{
if(v[i]<v[j]&&l[j]>maxi)
{
maxi=l[j];
p=j;
}
}
urm[i]=p;
l[i]=maxi+1;
}
p=1;
maxi=0;
for(i=1;i<=n;i++)
{
if(l[i]>maxi)
{
maxi=l[i];
p=i;
}
}
g<<maxi<<'\n';
while(p>0)
{
g<<v[p]<<" ";
p=urm[p];
}
f.close();
g.close();
return 0;
}