Cod sursa(job #720405)
Utilizator | onisim necula misino | Data | 22 martie 2012 17:19:32 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int maxi,i,n,j,max1,b[100001],a[100001];
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>a[i];
b[n]=1;
for(i=n-1;i>=1;--i)
{max1=0;
for(j=i+1;j<=n;++j)
if(a[j]>a[i]&&max1<b[j])
max1=b[j];
b[i]=max1+1;
if(b[i]>maxi)
maxi=b[i];
}
g<<maxi<<'\n';
for(i=1;i<=n;++i)
if(b[i]==maxi)
{g<<a[i]<<' ';
maxi--;
}
f.close();
g.close();
return 0;
}