Cod sursa(job #1336075)
Utilizator | Data | 6 februarie 2015 16:11:03 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,m,i,j,v[100001],l[100001],poz[100001],prim;
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
for(i=n;i>=1;i--)
{
l[i]=1;
poz[i]=0;
for(j=i+1;j<=n;j++)
if(v[i]<v[j] && l[i]<1+l[j])
{
l[i]=1+l[j];
poz[i]=j;
}
if(m<l[i])
{
m=l[i];
prim=i;
}
}
g<<m<<'\n';
for(i=prim;i>0;i=poz[i])
g<<v[i]<<" ";
return 0;
}