Cod sursa(job #2299926)
| Utilizator | Data | 10 decembrie 2018 16:03:48 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,nmax,k;
int a[100005],dp[100005], t[100005];
int 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];
k=1;
dp[k]=1;
for(int i=2; i<=n; ++i)
{
int st=1, dr=k,m=0;
while(st<=dr)
{
m=(st+dr)/2;
if(a[dp[m]]<a[i]) st=m+1;
else dr=m-1;
}
if(st>k) k++;
dp[st]=i;
t[i]=dp[st-1];
}
g<<k<<'\n';
afis(dp[k]);
g.close();
return 0;
}
