Cod sursa(job #3004701)
| Utilizator | Data | 16 martie 2023 15:44:50 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100001],len[100001],ant[100001],lmax,pmax;
int main()
{
fin >> n;
for(int i=1;i<=n;i++)
fin >> v[i];
for(int i=n;i>=1;i--)
{
len[i]=1;
ant[i]=-1;
for(int j=i;j<=n;j++)
{
if(v[j]>v[i])
{
if(len[i]<len[j]+1)
{
len[i]=len[j]+1;
ant[i]=j;
}
}
}
if(len[i]>lmax)
{
lmax=len[i];
pmax=i;
}
}
fout << lmax << "\n";
while(pmax!=-1)
{
fout << v[pmax] << " ";
pmax=ant[pmax];
}
return 0;
}
