Cod sursa(job #3341452)
| Utilizator | Data | 19 februarie 2026 16:59:37 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.8 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int n,v[50],max=-1,x1,x2,i2;
fin>>n;
int L[256];
for(int i=1;i<=n;i++)
{
fin>>v[i];
L[i]=1;
}
for(int i=n;i>=1;i--)
{
max=0;
for(int j=i+1;j<=n;j++)
{
if(v[i]<v[j] &&L[j]>max)
{
max=L[j];
L[i]=max+1;
i2=i;
}
}
}
fout<<v[i2]<<" ";
for(int i=i2;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(L[i]==L[j]+1)
{
fout<<v[j]<<" ";
i=j-1;
break;
}
}
}
}
/*
5
24 12 15 15 19*/
