Pagini recente » Cod sursa (job #3273651) | Cod sursa (job #1132474) | Cod sursa (job #2509726) | Cod sursa (job #2496715) | Cod sursa (job #2739520)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("scmax.int");
ofstream fout("scmax.out");
long long P[100001],I[100001],D[100001];
int main()
{
long long k,i,A[100001],n;
fin>>n;
for(i=1;i<=n;i++)
fin>>A[i];
k=1;
D[k] = A[1];
P[1] = 1;
for(int i = 2 ; i <= n ; i ++)
if(A[i] > D[k])
D[++k] = A[i], P[i] = k;
else
{
int st = 1 , dr = k , p = k + 1;
while(st <= dr)
{
int m = (st + dr) / 2;
if(D[m] > A[i])
p = m, dr = m - 1;
else
st = m + 1;
}
D[p] = A[i];
P[i] = p;
}
int j = n;
for(int i = k ; i >= 1 ; i --)
{
while(P[j] != i)
j --;
I[i] = j;
}
fout<<k<<'\n';
for(i=1;i<=k;i++)
fout<<A[I[i]]<<" ";
return 0;
}