Cod sursa(job #2826738)
| Utilizator | Data | 5 ianuarie 2022 12:31:52 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n,i,a[100001],b[100001],poz[100001],mx,p,j;
int main()
{
cin>>n;
for(i=1; i<=n; i++) cin>>a[i];
b[n]=1;
poz[n]=-1;
mx=1;
p=n;
for(i=n-1; i>=1; --i)
{
b[i]=1;
poz[i]=-1;
for(j=i+1; j<=n; ++j)
if(a[i]<a[j] && b[i]<b[j]+1)
{
b[i]=b[j]+1;
poz[i]=j;
if(b[i]>mx) mx=b[i],p=i;
}
}
cout<<mx<<'\n';
i=p;
while(i!=-1)
{
cout<<a[i]<<' ';
i=poz[i];
}
return 0;
}
