Pagini recente » Cod sursa (job #2310778) | Cod sursa (job #2894354) | Borderou de evaluare (job #2588894) | Cod sursa (job #2588275) | Cod sursa (job #2638690)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#define NMAX 100005
int main()
{
int a[NMAX];
int b[NMAX];
int p[NMAX];
int n;
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
int k = 1;
b[k] = a[1];
p[1] = 1;
for(int i=2;i<=n;i++)
{
if(a[i] > b[k])
{
b[++k] = a[i];
p[i] = k;
}
else
{
int st = 1;
int dr = k;
int poz = dr+1;
while(st<=dr)
{
int m = (st+dr)/2;
if(b[m] > a[i])
{
poz = m;
dr = m-1;
}
else
{
st = m+1;
}
}
b[poz] = a[i];
p[i] = poz;
}
}
fout<<k<<'\n';
vector<int> sol;
int c = k;
for(int i=n;i>=1;i--)
{
if(p[i] == c)
{
c--;
sol.push_back(a[i]);
}
}
reverse(sol.begin(),sol.end());
for(int i=0;i<sol.size();i++)
{
fout<<sol[i]<<" ";
}
return 0;
}