Cod sursa(job #3349026)
| Utilizator | Data | 24 martie 2026 23:58:40 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#define nmax (int)(1e7+1)
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int dp[nmax],n,m,v[nmax],t[nmax];
void rec(int n){
if(t[n]!=0)
rec(t[n]);
cout<<v[n]<<" ";
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
int st=1,dr=m,poz=m+1;
while(st<=dr){
int mid=(st+dr)/2;
if(v[dp[mid]]>=v[i]){
poz=mid;
dr=mid-1;
}else
st=mid+1;
}
if(poz==m+1)
m++;
t[i]=dp[poz-1];
dp[poz]=i;
}
cout<<m<<'\n';
rec(dp[m]);
return 0;
}
