poj 3903 Stock Exchange (最长上升子序列)
来源:互联网 发布:做微信发淘宝优惠券 编辑:程序博客网 时间:2024/05/18 01:07
Stock Exchange
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2579 Accepted: 935
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.
Source
Southeastern European Regional Programming Contest 2008
一直没学LIS的nlogn解法,最近有一题要用,于是先刷这道题练手吧。
#include <cstdio>#include <algorithm>using namespace std;const int maxn = 100000 + 5;const int INF = 1000000000;int a[maxn],g[maxn],d[maxn];int main(){ int n,ans; while(scanf("%d",&n) != EOF){ for(int i = 0;i < n;i++) scanf("%d",&a[i]); ans = -1; for(int i = 1;i <= n;i++) g[i] = INF; for(int i = 0;i < n;i++){ int k = lower_bound(g+1,g+n+1,a[i]) - g; d[i] = k; g[k] = a[i]; ans = max(ans,d[i]); } printf("%d\n",ans); } return 0;}
- POJ 3903 Stock Exchange 最长上升子序列
- poj 3903 Stock Exchange (最长上升子序列)
- 证券交易所 Stock Exchange 最长上升子序列 poj 3903
- POJ 3903 Stock Exchange (LIS:最长上升子序列)
- poj 3903 Stock Exchange 最长上升子序列
- POJ 3903 —— Stock Exchange 最长上升子序列
- POJ 3903 Stock Exchange 最长上升子序列 模板题
- poj 3903 Stock Exchange(求最长上升子序列长度)
- Stock Exchange (POJ 3903) —— 最长上升子序列
- poj 3903 stock exchange 最长上升子序列(n*log(n))
- POJ 3903 Stock Exchange 最大上升子序列
- POJ3903 Stock Exchange 最长上升子序列DP]
- poj3903--Stock Exchange--nlogn贪心求最长上升子序列
- poj3903 Stock Exchange(最长上升子序列)
- POJ 3903-Stock Exchange/POJ 2533-Longest Ordered Subsequence(LIS-最长递增子序列长度)
- poj 3903-Stock Exchange最大上升子序(dp)
- poj 3903 最长上升子序列
- poj 3903(最长上升子序列 )
- ORD模型实现CURD,自动验证及填充
- 如何解决ssh连接后长时间不操作断线的问题?
- Python中的Module用法实例
- JAVA NIO 缓冲区
- makefile与configure(转)
- poj 3903 Stock Exchange (最长上升子序列)
- Gitolite 构建 Git 服务器
- 经典String str = new String("abc")内存分配问题
- roi_pac安装-详细步骤
- POJ 3461 Oulipo
- ASP.NET生成IP签名图片
- 最长递增子序列
- Pear Linux 6.1 发布,法语的桌面 Linux 系统
- 电梯调度算法