poj 2533 最长上升子序列

方法一，dp

如果 a[i]>a[j] ,那么dp[i]=max(dp[i],dp[j]+1)

#include<iostream>#include<set>#include<algorithm>using namespace std;int main(){int n,dat;while(cin>>n){multiset<int>myset;multiset<int>::iterator pos;for(int i=0;i<n;i++){cin>>dat;myset.insert(dat);pos=myset.find(dat);if(++pos!=myset.end())myset.erase(pos);}cout<<myset.size()<<endl;}}