Pagini recente » Cod sursa (job #1702096) | Cod sursa (job #795321) | Cod sursa (job #798956) | Cod sursa (job #626552) | Cod sursa (job #802322)
Cod sursa(job #802322)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("SCM.in");
ofstream g("SCM.out");
int main()
{
int v[100],l[100],tata[100],i,n,max,pm,j,mx;
f>>n;
for (i=1;i<=n;i++) f>>v[i];
l[n]=1;tata[n]=0;
for (i=n-1;i>0;i--)
{
max=0;
for (j=i+1;j<=n;j++) if ((v[i]<v[j])&&(l[j]>max))
{
max=l[j];
pm=j;
}
if (max==0) {tata[i]=0;l[i]=1;}
else { l[i]=max+1;tata[i]=pm; }
}
mx=0;
for (i=1;i<=n;i++) if (mx<l[i]) {mx=l[i];j=i;}
g<<"Lungimea SCM = "<<mx<<endl;
i=j;g<<v[i]<<" ";
while (tata[i]!=0) {g<<v[tata[i]]<<" ";i=tata[i];}
return 0;
}