Cod sursa(job #2296002)
| Utilizator | Data | 4 decembrie 2018 03:20:54 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
#define Nmax 100001
using namespace std;
ifstream f("scmax.in"); ofstream g("scmax.out");
int n,a[1000007],x[100007],t[100007];
void afis(int m)
{ if(m)
{ afis(t[m]);
g<<a[m]<<" ";
}
}
int main()
{ f>>n;
for(int i=1;i<=n;i++) f>>a[i];
x[1]=1;
int s=1;
for(int i=2;i<=n;i++)
{ int p=1,u=s;
while(p<=u)
{ int m=(u+p)/2;
if(a[x[m]]<a[i]) p=m+1; else u=m-1;
}
if(p>s) s++;
x[p]=i; t[i]=x[p-1];
}
g<<s<<"\n";
afis(x[s]);
return 0;
}
