Cod sursa(job #3279283)
| Utilizator | Data | 22 februarie 2025 13:23:38 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n,v[100001],d[100001],maxi,b[100001],poz;
int main() {
fin>>n;
for(int i=1;i<=n;i++){
fin>>v[i];
d[i]=1;
}
for(int i=n;i>=1;i--){
for(int j=i;j<=n;j++){
if(v[i]<v[j]) {
if(d[i]<=d[j]+1){
d[i]=d[j]+1;
b[i]=j;
}
}
}
}
for(int i=1;i<=n;i++){
if(d[i]>maxi){
maxi=d[i];
poz=i;
}
}
fout<<maxi<<'\n';
while(d[poz]>0){
fout<<v[poz]<<" ";
poz=b[poz];
}
return 0;
}
