Cod sursa(job #3174405)
| Utilizator | Data | 24 noiembrie 2023 18:47:57 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,s[100001],dp[100001];
void citire()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>s[i];
}
void pos()
{
int mx=-1;
for(int i=n;i>0;i--)
{
dp[i]=1;
for(int j=i+1;j<=n+1;j++)
if(s[i]<s[j])
{
dp[i]=max(dp[i],dp[j]+1);
mx=max(mx,dp[i]);
}
}
fout<<mx<<endl;
for(int i=1;i<=n;i++)
{
if(dp[i]==mx)
{
fout<<s[i]<<" ";
mx=mx-1;
}
}
}
int main()
{
citire();
pos();
return 0;
}
