Pagini recente » Istoria paginii runda/fdhdfj | Cod sursa (job #2273946) | Cod sursa (job #2223770) | Cod sursa (job #2750164) | Cod sursa (job #2553679)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout ("scmax.out");
vector <int> best;
int n,x,i,poz;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
if(i==1 || x>best[best.size()-1])
best.push_back(x);
else
{
poz = lower_bound(best.begin(), best.end(), x) - best.begin();
best[poz]=x;
}
}
fout<<best.size();
return 0;
}