Pagini recente » Cod sursa (job #1142698) | Cod sursa (job #1862734) | Cod sursa (job #2663115) | Cod sursa (job #544013) | Cod sursa (job #3185165)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100001], q[100001];
int main()
{
int n, l = 1;
fin >> n;
for (int i = 1; i <= n; i++)
fin >> v[i];
q[1] = v[1];
for (int i = 2; i <= n; i++) {
int x = v[i];
if(x >= q[l])
q[++l] = x;
else if(x < q[1])
q[1] = x;
else {
int st = 1, dr = l;
while(st + 1 < dr) {
int m = (st + dr) / 2;
if(x < q[m])
dr = m;
else
st = m;
}
q[dr] = x;
}
}
fout << l;
return 0;
}