Cod sursa(job #497455)
Utilizator | Militaru Gabriel Ovidiu militer | Data | 2 noiembrie 2010 16:23:08 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<iostream>
#include<fstream>
using namespace std;
int a[100005],b[100005];
int main()
{int n,i,x,m=0,c[1000],y=0;
int max=0;
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=n;i++)
{b[i]=1;
for(int j=i-1;j>0;j=j-1)
if(a[i]>a[j] && b[i] < b[j] + 1)
b[i]=1+b[j];
if(max<b[i])
{max=b[i];
c[y]=i;
y++;
m++;
}
}
g<<max<<endl;
for(int i=0;i<m;i++)
g<<a[c[i]]<<" ";
f.close();
g.close();
return 0;
}