POJ 3903 Stock Exchange(最长上升子序列O（n*logn）解法）

最新推荐文章于 2021-07-24 09:11:52 发布

原创最新推荐文章于 2021-07-24 09:11:52 发布 · 224 阅读

1 ·

CC 4.0 BY-SA版权

基础dp 专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一个算法问题，即如何快速找到一系列股票价格中的最长上升趋势。通过使用C++实现的程序，有效地解决了这一问题，并提供了样例输入输出以验证算法的有效性。

Stock Exchange

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7369		Accepted: 2585

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.

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.

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.

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string.h>
int a[100002],dp[100003];
int INF=1e9;
using namespace std;
int main()
{
	int m;
	while(scanf("%d",&m)!=EOF)
	{
		for(int i=1;i<=m;i++)
			scanf("%d",&a[i]);
		for(int i=1;i<=m+1;i++)
			dp[i]=INF;
		for(int i=1;i<=m;i++)
		{
			*lower_bound(dp+1,dp+i+1,a[i])=a[i];
		}
		printf("%d\n",lower_bound(dp+1,dp+m+1,INF)-dp-1);
	}
	return 0;
}