Pagini recente » Cod sursa (job #333072) | Cod sursa (job #1201433) | Borderou de evaluare (job #156711) | Cod sursa (job #563368) | Cod sursa (job #3002364)
#include <bits/stdc++.h>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int a[100005], d[100005], n, poz[100005], k;
int st[100005], top;
int CautBin(int x)
{
int st = 1, dr = k, mij = 0, p = k;
while(st <= dr)
{
mij = (st + dr)/2;
if(x <= d[mij])
{
p = mij;
dr = mij - 1;
}
else st = mij + 1;
}
return p;
}
int main()
{
int i, j, p;
in >> n;
for(i = 1; i <= n; i++)
in >> a[i];
k = 1;
poz[1] = 1;
d[1] = a[1];
for(i = 2; i <= n; i++)
{
if(d[1] >= a[i])
{
d[1] = a[i];
poz[i] = 1;
}
else if(d[k] < a[i])
{
d[++k] = a[i];
poz[i] = k;
}
else
{
p = CautBin(a[i]);
d[p] = a[i];
poz[i] = p;
}
}
out << k << "\n";
for(i = n; i >= 1 and k > 0; i--)
if(poz[i] == k)
{
st[++top] = a[i];
k--;
}
for(i = top; i >= 1; i--)
out << st[i] << " ";
return 0;
}