POJ-1877,3903 LIS
2013-05-21 01:53
253 查看
1877题目链接:http://poj.org/problem?id=1887
3903题目链接:http://poj.org/problem?id=3903
数据大,线性优化,O(n*logn)。
1877:
View Code
3903题目链接:http://poj.org/problem?id=3903
数据大,线性优化,O(n*logn)。
1877:
//STATUS:C++_AC_63MS_756KB #include <functional> #include <algorithm> #include <iostream> //#include <ext/rope> #include <fstream> #include <sstream> #include <iomanip> #include <numeric> #include <cstring> #include <cassert> #include <cstdio> #include <string> #include <vector> #include <bitset> #include <queue> #include <stack> #include <cmath> #include <ctime> #include <list> #include <set> #include <map> using namespace std; //define #define pii pair<int,int> #define mem(a,b) memset(a,b,sizeof(a)) #define lson l,mid,rt<<1 #define rson mid+1,r,rt<<1|1 #define PI acos(-1.0) //typedef typedef __int64 LL; typedef unsigned __int64 ULL; //const const int N=100010; const int INF=0x3f3f3f3f; const int MOD=100000,STA=8000010; const LL LNF=1LL<<60; const double EPS=1e-8; const double OO=1e15; const int dx[4]={-1,0,1,0}; const int dy[4]={0,1,0,-1}; //Daily Use ... inline int sign(double x){return (x>EPS)-(x<-EPS);} template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;} template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;} template<class T> inline T Min(T a,T b){return a<b?a:b;} template<class T> inline T Max(T a,T b){return a>b?a:b;} template<class T> inline T Min(T a,T b,T c){return min(min(a, b),c);} template<class T> inline T Max(T a,T b,T c){return max(max(a, b),c);} template<class T> inline T Min(T a,T b,T c,T d){return min(min(a, b),min(c,d));} template<class T> inline T Max(T a,T b,T c,T d){return max(max(a, b),max(c,d));} //End int num ,f ; int T,n; int binary(int l,int r,int tar) { int mid; while(l<r){ mid=(l+r)>>1; if(f[mid]<tar)l=mid+1; else r=mid; } return l; } int main() { // freopen("in.txt","r",stdin); int i,j,l,r,k; while(~scanf("%d",&n)) { for(i=0;i<n;i++){ scanf("%d",&num[i]); } l=1;r=2; f[1]=INF; for(i=0;i<n;i++){ k=binary(l,r,num[i]); f[k]=num[i]; r=Max(r,k+1); } printf("%d\n",r-1); } return 0; }
View Code
相关文章推荐
- Poj 3903 Stock Exchange(LIS)
- POJ 3903 Stock Exchange【LIS 二分查找】
- Poj 3903 Stock Exchange(LIS)
- POJ 3903 Stock Exchange(LIS)
- POJ 3903 Stock Exchange(LIS)
- LIS系列问题(hdu 4521、poj 3903)
- POJ 3903 Stock Exchange_LIS(最长递增子序列) 经典例题!
- POJ 3903(LIS)
- poj3903 LIS的优化
- POJ 3903 Stock Exchange (LIS:最长上升子序列)
- POJ - 3903 Stock Exchange(LIS最长上升子序列问题)
- POJ 3903 Testingthe CATCHER ( LIS )
- POJ 3903-Stock Exchange/POJ 2533-Longest Ordered Subsequence(LIS-最长递增子序列长度)
- LIS(nlogn) POJ 3903 Stock Exchange
- POJ 3903 Stock Exchange(LIS)
- POJ - 3903-Stock Exchange(LIS二分模板题)
- poj 3903 LIS
- POJ 1836 Alignment (动态规划LIS)
- POJ 1836 Alignment( LIS )
- poj 3903