Cod sursa(job #3126030)
| Utilizator | Data | 5 mai 2023 11:01:47 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int v[100001], dp[100001],n,k,i,tata[100001];
void reconst(int k){
if(k>0){
reconst(tata[k]);
cout<<v[k]<<" ";
}
}
int main()
{
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
for(int i=1;i<=n;i++){
int st=1, dr=k;
while(st<=dr){
int mid=(st+dr)/2;
if(v[i]<=v[dp[mid]])
dr=mid-1;
else
st=mid+1;
}
if(st>k)
k++;
dp[st]=i;
tata[i]=dp[st-1];
}
cout<<k<<"\n";
reconst(dp[k]);
return 0;
}
