Stock Exchange

Stock Exchange

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4090		Accepted: 1471

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.

 

先给个复杂度为O（n^2）的用dp做的：

[cpp]  view plain  copy

1. #include<stdio.h>  
2. int dp[100010];  
3. int maxn(int i,int j) {return i > j ? i : j;}  
4. int main()  
5. {  
6.     int L,i,j,a[100010];  
7.   
8.     while(~scanf("%d", &L))  
9.     {  
10.         for(i=1; i<=L; i++)  
11.             scanf("%d", a+i);  
12.         int len = 1;  
13.         for(i=1; i<=L; i++)  
14.         {  
15.             dp[i] = 1;  
16.             for(j=1; j<i; j++)  
17.             {  
18.                 if(a[i] > a[j]) dp[i] = maxn(dp[i],dp[j]+1);  
19.             }  
20.             len = maxn(len,dp[i]);  
21.         }  
22.         printf("%d\n", len);  
23.     }  
24.     return 0;  
25. }  

很荣幸的，，它超时了。。数据太大，明显过不了，但也是一种有用的方法。

现在换个时间复杂度为O（nlogn）的，利用二分法，，至于为啥，可以参考一下最下面博文的链接

[cpp]  view plain  copy

1. #include<stdio.h>  
2. int a[100010],c[100010];  
3. int maxn(int i,int j) {return i > j ? i : j;}  
4. int binary(int len,int k)  
5. {  
6.     int l = 1, r = len;  
7.     while(l < r)  
8.     {  
9.         int mid = l+(r-l)/2;  
10.         if(k == c[mid]) return mid;  
11.         if(k > c[mid]) l = mid+1;  
12.         else  r = mid;  
13.     }  
14.     return r;  
15. }  
16. int main()  
17. {  
18.     int L,i,j;  
19.   
20.     while(~scanf("%d", &L))  
21.     {  
22.         for(i=1; i<=L; i++)  
23.             scanf("%d", a+i);  
24.         int len = 0;  
25.         for(i=1; i<=L; i++)  
26.         {  
27.             if(len == 0 || a[i] > c[len])  
28.                 c[++len] = a[i];  
29.             else  
30.             {  
31.                 int k = binary(len,a[i]);  
32.                 c[k] = a[i];  
33.             }  
34.         }  
35.         printf("%d\n", len);  
36.     }  
37.     return 0;  
38. }  

本文参考了许多博文，主要有以下三篇：

http://blog.csdn.net/linulysses/article/details/5559262

http://blog.csdn.net/joylnwang/article/details/6766317

http://blog.csdn.net/libin56842/article/details/9633687

建议直接看上述博客，讲得十分细致易懂，在此感谢。

今天又在书《挑战程序设计竞赛》上看到了一个用STL写的，很方便：

[cpp]  view plain  copy

1. #include<stdio.h>  
2. #include<algorithm>  
3. using namespace std;  
4. #define INF 1<<30  
5. int main()  
6. {  
7.     int n, a[100010], dp[100010];  
8.   
9.     while(~scanf("%d", &n))  
10.     {  
11.         for(int i=0; i<n; i++)  
12.         {  
13.             scanf("%d", a+i);  
14.             dp[i] = INF;  
15.         }  
16.         for(int i=0; i<n; i++)  
17.             *lower_bound(dp, dp+n, a[i]) = a[i];  
18.         printf("%d\n", lower_bound(dp, dp+n, INF)-dp);  
19.     }  
20.     return 0;  
21. }