Cod sursa(job #1883221)
Utilizator | Data | 17 februarie 2017 20:15:06 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int N = 100000;
int n, v[N], p[N], dp[N], lmax=0, imax=0;;
void afis(int i)
{
if(dp[i]!=1) afis(p[i]);
fout<<v[i]<<" ";
}
int main()
{
fin>>n;
for(int i=0;i<n;i++)
fin>>v[i];
for(int i=0;i<n;i++)
{
dp[i]=1;
for(int j=0;j<i;j++)
if(v[j]<v[i])
if(dp[j]+1>dp[i])
dp[i]=dp[j]+1, p[i]=j;
if(dp[i]>lmax)
lmax=dp[i], imax=i;
}
fout<<lmax<<'\n';
afis(imax);
return 0;
}