Mai intai trebuie sa te autentifici.
Cod sursa(job #2924021)
| Utilizator | Data | 23 septembrie 2022 09:53:31 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.94 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[100001], lmax, imax, l[100001], p[100001]; //lungimi+precednti
void afis()
{
for(int i=1; i<=n; i++) cout<<l[i]<<" ";
cout<<'\n';
for(int i=1; i<=n; i++) cout<<p[i]<<" ";
cout<<'\n';
}
int main()
{
fin>>n;
for(int i=1; i<=n; i++) fin>>v[i];
for(int i=1; i<=n; i++)
{
l[i]=1;
for(int j=1; j<i; j++)
{
if(v[j]<v[i])
{
if(l[i]<l[j]+1)
{
l[i]=l[j]+1;
p[i]=j;
}
}
}
if(lmax<l[i])
{
lmax=l[i];
imax=i;
}
}
fout<<lmax<<'\n';
stack <int> s;
while(l[imax])
{
s.push(v[imax]);
imax=p[imax];
}
while(!s.empty())
{
fout<<s.top()<<" ";
s.pop();
}
afis();
}