Cod sursa(job #2432291)
| Utilizator | Data | 22 iunie 2019 21:20:53 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define NMAX 100001
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[NMAX],lg[NMAX],i,j,n,maxx,p;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
lg[n]=1;
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;++j)
if(v[i]<v[j]&&lg[j]>maxx) maxx=lg[j];
lg[i]=maxx+1;
}
maxx=0;
for(i=1;i<=n;++i)
if(lg[i]>maxx)maxx=lg[i],p=i;
fout<<maxx<<"\n";
fout<<v[p]<<" ";
for(i=p+1;i<=n;++i)
if(v[i]>v[p]&&lg[i]==maxx-1)
{
fout<<v[i]<<" ";
maxx--;
}
return 0;
}
