Pagini recente » Cod sursa (job #1621710) | Cod sursa (job #802119) | Cod sursa (job #1448996) | Cod sursa (job #1933478) | Cod sursa (job #2838070)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int INF=1e9;
int lis(vector<int>a)
{
int n=a.size();
vector<int>d(n+1,INF),p(n+1,-1),ind(n+1,-1),rec;
d[0]=-INF;
p[0]=-1;
for(int i=0;i<n;i++)
{
int j=upper_bound(d.begin(),d.end(),a[i]) - d.begin();
if(d[j-1]<a[i]&&a[i]<d[j])
{
d[j]=a[i];
//p[i]=ind[j-1];
//ind[j]=i;
}
}
for(int i=n;i>=0;i--)
if(d[i]!=INF)
{
return i;
//int j=i;
//while(j!=-1)
//{
// rec.push_back(a[j]);
// j=p[j];
//}
//sort(rec.begin(),rec.end());
//return rec;
}
}
vector<int>v;
int main()
{
int n,i,x;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x;
v.push_back(x);
}
fout<<lis(v);
//fout<<rez;
}