Cod sursa(job #2922913)
| Utilizator | Data | 10 septembrie 2022 16:49:41 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include<bits/stdc++.h>
#define int long long
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[100005],n,t[100005],r[100005];
void reconstruire(int x)
{
if(x!=0)
{
reconstruire(r[x]);
g<<v[x]<<" ";
}
}
signed main()
{
int i,l=0,st,dr,p;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
st=1;
dr=l;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[t[mij]]<v[i])
st=mij+1;
else
dr=mij-1;
}
p=st;
if(p>l)
l=p;
t[p]=i;
r[i]=t[p-1];
}
g<<l<<'\n';
reconstruire(t[l]);
return 0;
}
