Cod sursa(job #2431461)
| Utilizator | Data | 19 iunie 2019 16:35:33 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100002],r[100002],t[100002],st,dr,k,i,mij,n;
void reconstituire(int x)
{
if(x!=0)
{
reconstituire((r[x]));
fout<<v[x]<<" ";
}
}
int main()
{
fin>>n;
for(i=1;i<=n;++i)
fin>>v[i];
for(i=1;i<=n;++i)
{
st=1,dr=k;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[t[mij]]<v[i]) st=mij+1;
else dr=mij-1;
}
t[st]=i;
if(st>k) k=st;
r[i]=t[st-1];
}
fout<<k<<"\n";
reconstituire(t[k]);
return 0;
}
