Cod sursa(job #2332137)
| Utilizator | Data | 30 ianuarie 2019 13:55:36 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k[100010],c=0,mx=1,v[100010],p[100010],o[100010];
int main()
{
ifstream cin("scmax.in");
ofstream cout("scmax.out");
cin>>n;
for(int i=0;i<n;i++)
{
cin>>k[i];
v[i]=1;
}
for(int i=1;i<=n;i++)
{
mx=0;
for(int j=0;j<i;j++)
{
if(k[j]<k[i]&&v[j]>mx)
{
mx=v[j];
p[i]=j;
}
}
v[i]=mx+1;
}
mx=0;
for(int i=0;i<n;i++)
{
if(v[i]>v[mx])mx=i;
}
int i=mx,j=1;
while(i)
{
o[j]=k[i];
i=p[i];
j++;
}
for(j=mx-1;j>0;j--)
{
cout<<o[j]<<" ";
}
}
