Cod sursa(job #2909474)
| Utilizator | Data | 13 iunie 2022 21:18:42 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int a[100001],b[100001],c[100001],n,i,j,poz,maxi;
int main()
{
cin>>n;
for (i=1;i<=n;i++)
cin>>a[i];
for (i=n;i>=1;i--)
{
b[i]=1;
c[i]=-1;
for (j=i;j<=n;j++)
if (a[i]<a[j] && b[i]<b[j]+1)
{
b[i]=b[j]+1;
c[i]=j;
}
}
maxi=b[0];
for (i=1;i<=n;i++)
if (maxi<b[i])
{
maxi=b[i];
poz=i;
}
cin>>maxi;
while (poz!=-1)
{
cout<<a[poz]<<" ";
poz=c[poz];
}
return 0;
}