Pagini recente » Cod sursa (job #1796507) | Cod sursa (job #2714148) | Cod sursa (job #2086031) | Cod sursa (job #1296311) | Cod sursa (job #2488144)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, a[100005], lis[100005], k, v[100005], sol[100005];
int main()
{
int i, st, dr, mij, poz, len = 0;
fin >> n;
for(i = 1; i <= n; i++)
{
fin >> a[i];
if(a[i] > lis[k])
{
lis[++k] = a[i];
v[i] = k;
}
else
{
st = 1;
dr = k;
while(st <= dr)
{
mij = (st + dr) / 2;
if(lis[mij] >= a[i])
{
poz = mij;
dr = mij - 1;
}
else
st = mij + 1;
}
lis[poz] = a[i];
v[i] = poz;
}
}
fout << k << "\n";
for(i = n; i >= 1; i--)
{
if(v[i] == k)
{
sol[++len] = a[i];
k--;
}
}
for(i = len; i >= 1; i--)
fout << sol[i] << " ";
fout << "\n";
fin.close();
fout.close();
return 0;
}