Pagini recente » Borderou de evaluare (job #3209089) | Borderou de evaluare (job #903562) | Cod sursa (job #2638634)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int INF = 1e9;
int n;
int v[100100], best[100100], small[100100];
int binarySearch(int value)
{
int l = 1, r = n, mid;
while(l <= r)
{
mid = (l + r) / 2;
if(small[mid] < value)
l = mid + 1;
else
r = mid - 1;
}
return mid;
}
int main()
{
in >> n;
for(int i = 1; i <= n; i++)
in >> v[i];
for(int i = 0; i <= n; i++)
small[i] = INF;
best[1] = 1;
small[1] = v[1];
for(int i = 2; i <= n; i++)
{
best[i] = binarySearch(v[i]);
while(small[best[i]] < v[i])
best[i]++;
if(small[best[i]] > v[i])
small[best[i]] = v[i];
}
out << best[n] << '\n';
return 0;
}