Mai intai trebuie sa te autentifici.
Cod sursa(job #809182)
Utilizator | Data | 7 noiembrie 2012 23:27:31 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.85 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int a[100],lgmax[100],urm[100],n,maxim,poz;
void citire();
void pd();
void afisare();
int main()
{
citire();
pd();
afisare();
fout.close();
return 0;
}
void citire()
{
int i;
fin>>n;
for(i=0;i<=n-1;i++)
fin>>a[i];
}
void pd()
{
int i,j;
lgmax[n-1]=1;
urm[n-1]=-1;
for(i=n-2;i>=0;i--)
{
lgmax[i]=1;
urm[i]=-1;//nu urm nimeni dupa ai
for(j=i+1;j<=n-1;j++)
if(a[i]<a[j] && lgmax[i]<lgmax[j]+1)
{
lgmax[i]=lgmax[j]+1;
urm[i]=j;
}
}
}
void afisare()
{
int i;
maxim=lgmax[1];
poz=1;
for(i=1;i<=n;i++)
if(maxim<lgmax[i])
{
maxim=lgmax[i];
poz=i;
}
fout<<maxim<<'\n';
i=poz;
while(i!=-1)
{
fout<<a[i]<<' ';
i=urm[i];
}
}