Cod sursa(job #2264449)
| Utilizator | Data | 20 octombrie 2018 09:35:32 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#define nMax 100005
int n,v[nMax],dp[nMax],i,j,poz[nMax],maxi=0,k;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=n;i>0;i--)
{
dp[i]=1;poz[i]=0;
for(j=i+1;j<=n;j++)
{
if(v[i]<v[j]&&dp[i]<1+dp[j])
{
dp[i]=1+dp[j];
poz[i]=j;
}
if(maxi<dp[i])
{
maxi=dp[i];
k=i;
}
}
}
fout<<maxi<<endl;
for(i=k;i>0;i=poz[i])
fout<<v[i]<<' ';
}
