Cod sursa(job #3211566)
| Utilizator | Data | 9 martie 2024 15:20:50 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,v[1000001],a[1000001],i,j,k,m,poz,poz1,min1;
int main()
{
in>>n;
for(i=0;i<n;i++){
in>>v[i];
a[i]=1;
}
for(k=1;k<=n;k++){
for(i=0;i<k;i++)
if(v[k]>v[i])
a[k]=max(a[k],a[i]+1);
}
m=*max_element(a,a+n);
out<<m<<'\n';
v[poz1]=-1;
for(k=1;k<=m;k++)
{
min1=INT_MIN;
for(i=poz1+1;i<n;i++)
if(a[i]==k&&v[i]>min1&&v[i]>=v[poz1])
{
min1=v[i];
poz=i;
}
out << v[poz] << " ";
poz1=poz;
}
return 0;
}