Pagini recente » Cod sursa (job #1696842) | Cod sursa (job #2220725) | Istoria paginii utilizator/slendersnax | Cod sursa (job #1867924) | Cod sursa (job #852111)
Cod sursa(job #852111)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long long a[100000],poz[100000],best[100000];
int n,i,j,p,max;
fstream f("scmax.in",ios::in);
fstream g("scmax.out",ios::out);
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
best[n]=1;
poz[n]=-1;
p=n;
max=1;
for(i=n-1;i>=1;i--)
{
best[i]=1;
poz[i]=-1;
for(j=i+1;j<=n;j++)
if(a[i]<a[j]&&best[i]<best[j]+1)
{
best[i]=best[j]+1;
poz[i]=j;
}
if(best[i]>max)
max=best[i],p=i;
}
g<<max<<"\n";
i=p;
while(i!=-1)
{
g<<a[i]<<" ";
i=poz[i];
}
f.close();
}