Mai intai trebuie sa te autentifici.
Cod sursa(job #1665093)
Utilizator | Data | 26 martie 2016 16:13:57 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
using namespace std;
int pred[100],v[100],lung[100],n;
void sir(int p)
{
if(pred[p]!=0)
sir(pred[p]);
cout<<v[p]<<" ";
}
int main()
{
int i,pmax,j;
cin>>n;
lung[1]=1;
pred[1]=0;
pmax=1;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=2;i<=n;i++)
{
lung[i]=0;
for(j=1;j<i;j++)
if(v[j]<v[i])
if(lung[j]>lung[i])
{
lung[i]=lung[j];
pred[i]=j;
}
lung[i]++;
if(lung[i]>lung[pmax])
pmax=1;
}
sir(pmax);
return 0;
}