Pagini recente » Cod sursa (job #3326057) | Cod sursa (job #3326066) | Cod sursa (job #3326060) | Cod sursa (job #3326026) | Cod sursa (job #3326059)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin(scm.in);
ofstream fout(scm.out);
int a[100],n,i,j,lung[100],poz[100];
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
lung[n]=1;poz[n]=-1;
for(i=n;i>=1;i--)
{
lung[i]=1;poz[i]=-1;
for(j=n;j>i;j--)
if(a[i]<a[j]&&lung[i]<lung[j]+1)
{
lung[i]=lung[j]+1;
poz[i]=j;
}
}
fout<<"vectorul poz: ";
for(i=1;i<=n;i++) fout<<poz[i]<<" ";
fout<<"vectorul lung: ";
for(i=1;i<=n;i++) fout<<lung[i]<<" ";
int maxim=INT_MIN,pozitie;
for(i=1;i<=n;i++)
if(lung[i]>maxim)
{
maxim=lung[i];pozitie=1;
}
fout<<"\nlungimea SCM:"<<maxim;
return 0;
}