Pagini recente » Cod sursa (job #2884128) | Cod sursa (job #2199207) | Cod sursa (job #2358633) | Cod sursa (job #2948333) | Cod sursa (job #1934968)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int lg[100004],n,lmax,pmax=-1,i,j,poz[100004];
long long v[100004];
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
poz[n]=-1;
lg[n]=1;
for(i=n-1;i;i--)
{
lg[i]=1;
poz[i]=-1;
for(j=i+1; j<=n; j++)
{
if(v[i]<v[j] && lg[i]<lg[j]+1)
{
lg[i]=lg[j]+1;
poz[i]=j;
}
}
if(lg[i]>lmax)
{
lmax=lg[i];
pmax=i;
}
}
g<<lmax<<'\n';
while(pmax!=-1)
{
g<<v[pmax]<<" ";
pmax=poz[pmax];
}
return 0;
}