Cod sursa(job #1156520)
Utilizator | Cristina Borza cristina_borza | Data | 27 martie 2014 19:02:02 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100001],b[100001],i,n,maxx,poz,j;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
b[n]=1;
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;j++)
{
if(a[j]>a[i])
if(b[j]>maxx)
maxx=b[j];
}
b[i]=maxx+1;
}
maxx=0;
poz=1;
for(i=1;i<=n;i++)
if(b[i]>maxx)
maxx=b[i],poz=i;
fout<<maxx<<'\n';
for(i=poz;i<=n;i++)
{
if(maxx==b[i] && a[i]>=a[poz])
{
maxx--;
fout<<a[i]<<" ";
}
}
return 0;
}