POJ3903:Stock Exchange(LIS)
来源:互联网 发布:淘宝网男长袖t恤 编辑:程序博客网 时间:2024/05/17 00:16
Description
The world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He follows stock prices every day looking for rising trends. Given a sequence of numbers p1, p2,...,pn representing stock prices, a rising trend is a subsequence pi1 < pi2 < ... < pik, with i1 < i2 < ... < ik. John’s problem is to find very quickly the longest rising trend.
Input
Each data set in the file stands for a particular set of stock prices. A data set starts with the length L (L ≤ 100000) of the sequence of numbers, followed by the numbers (a number fits a long integer).
White spaces can occur freely in the input. The input data are correct and terminate with an end of file.
White spaces can occur freely in the input. The input data are correct and terminate with an end of file.
Output
The program prints the length of the longest rising trend.
For each set of data the program prints the result to the standard output from the beginning of a line.
For each set of data the program prints the result to the standard output from the beginning of a line.
Sample Input
6 5 2 1 4 5 3 3 1 1 1 4 4 3 2 1
Sample Output
3 1 1
Hint
There are three data sets. In the first case, the length L of the sequence is 6. The sequence is 5, 2, 1, 4, 5, 3. The result for the data set is the length of the longest rising trend: 3.
题意:依旧是一道LIS的裸题
思路:要注意数据比较多,要用二分的优化法,原本是与POJ2533一样的题,但是用2533的代码只改下数组大小是过不了的,WA了几次,后来发现二分函数需要改进,于是改成了下面的方式,而且这个二分函数用在2533也是可以的
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int a[100005],c[100005],n;int bin(int size,int k){ int l = 1,r = size; while(l<=r) { int mid = (l+r)/2; if(k>c[mid]) l = mid+1; else r = mid-1; } return l;}int LIS(){ int i,j,cnt=0,k; for(i = 1; i<=n; i++) { if(cnt == 0 || a[i]>c[cnt]) c[++cnt] = a[i]; else { k = bin(cnt,a[i]); c[k] = a[i]; } } return cnt;}int main(){ long i; while(~scanf("%d",&n)) { for(i = 1; i<=n; i++) scanf("%d",&a[i]); printf("%d\n",LIS()); } return 0;}
- POJ3903:Stock Exchange(LIS)
- POJ3903 Stock Exchange
- POJ3903 Stock Exchange
- POJ3903-----Stock Exchange
- POJ3903 Stock Exchange 最长上升子序列DP]
- poj3903--Stock Exchange--nlogn贪心求最长上升子序列
- poj3903 Stock Exchange(最长上升子序列)
- 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问题(POJ - 3903 Stock Exchange)
- poj3903 LIS的优化
- POJ 3903 Stock Exchange (LIS:最长上升子序列)
- POJ 3903 Stock Exchange (LIS模版题)
- TOJ 3120.Stock Exchange(LIS经典题目)
- POJ 3903-Stock Exchange/POJ 2533-Longest Ordered Subsequence(LIS-最长递增子序列长度)
- Oracle data guard常用维护操作命令
- Qt Creator应用程序发布及修改应用程序图标的方法
- javascript小技巧&&JavaScript[对象.属性]集锦
- Java:String和Date、Timestamp之间的转换
- 如果你也有资料收集强迫症?
- POJ3903:Stock Exchange(LIS)
- SDJZU-墓碑上的文字
- 给postfix设置黑名单
- DEV环境切换memo:从win环境切换到linux(ubuntu11.10)
- Android 源码结构分析
- Java创建Process对象调用linux shell过程乱码的探究
- zoj 2724
- Android中ListView的一些设置
- Android基础之R文件丢失报错