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