Cod sursa(job #1255837)
Utilizator | Data | 5 noiembrie 2014 11:42:34 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int a[100005],sol[100005],bst[100005];
int main()
{int n,i,j,mx=0,p,u;
in>>n;
for(i=1;i<=n;i++)
in>>a[i];
bst[n]=1;
sol[n]=-1;
for(i=n-1;i>=1;i--)
{
bst[i]=1;
sol[i]=-1;
for(j=i+1;j<=n;j++)
if(a[i]<a[j]&&bst[i]<bst[j]+1)
{
bst[i]=bst[j]+1;
sol[i]=j;
if(mx<bst[i]) mx=bst[i],p=i;
}
}
out<<mx<<'\n';
i=p;
while(i!=-1)
{
out<<a[i]<<" ";
i=sol[i];
}
return 0;
}