Cod sursa(job #3321568)
| Utilizator | Data | 10 noiembrie 2025 10:49:23 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 45 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int best[100002], n, v[100002], tata[100002];
void afis(int p){
if(p){
afis(tata[p]);
fout << v[p] << " ";
}
}
int main(){
int i,mx,ans=0,j,p;
fin >> n;
for(i=1;i<=n;i++){
fin >> v[i];
mx=0;
for(j=1;j<i;j++){
if(v[i] > v[j]){
mx = max(mx, best[j]);
tata[i] = j;
}
}
best[i] = 1+mx;
if(best[i] > ans){
ans = best[i];
p = i;
}
}
fout << ans << '\n';
afis(p);
}
