Pagini recente » Cod sursa (job #1228017) | Cod sursa (job #193177) | Cod sursa (job #2873319) | Cod sursa (job #1908177) | Cod sursa (job #2688709)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
int D[100001],A[100001],k,n;
f>>n;
for(int i=1;i<=n;i++)
f>>A[i];
k = 1, D[k] = A[1];
for(int i = 2 ; i <= n ; i ++)
{
if(A[i] > D[k])
D[++k] = A[i];
else
{
int st = 1, dr = k, poz = k + 1;
while(st <= dr)
{
int m = (st + dr) / 2;
if(D[m] > A[i])
poz = m, dr = m - 1;
else
st = m + 1;
}
D[poz] = A[i];
}
}
g<<k<<'\n';
for(int i=1;i<=k;i++)
g<<D[i]<<' ';
return 0;
}