Pagini recente » Cod sursa (job #1111372) | Cod sursa (job #3281628) | Cod sursa (job #2491838) | Cod sursa (job #2794782) | Cod sursa (job #1051387)
#include <iostream>
#include <fstream>
using namespace std;
int n, maxim, sol=0, p;
int a[100003], best[100003], poz[100003];
void citire()
{
ifstream fin("scmx.in");
fin>>n;
for(int i=1; i<=n; i++)
fin>>a[i];
fin.close();
}
void dinamic()
{
int i, j;
best[n]=1;
poz[n]=-1;
maxim=1, p=n;
for(i=n-1; i>=1; i--)
{
best[i]=1; poz[i]=-1;
for(j=i+1; j<=n;j++)
if(a[i]<a[j] && best[i]<best[j]+1)
{
best[i]=best[j]+1; poz[i]=j;
if(best[i]>maxim) maxim=best[i], p=i;
}
}
}
void scrieSir()
{
ofstream fout("scmx.out");
fout<<maxim<<"\n";
int i; i=p;
while(i!=-1)
{fout<<a[i]<<" "; i=poz[i];}
fout<<"\n";
fout.close();
}
int main()
{
citire();
dinamic();
scrieSir();
return 0;
}