POJ 3903 Stock Exchange （E - LIS 最长上升子序列）

POJ 3903    Stock Exchange  （E - LIS 最长上升子序列）

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87125#problem/E

题目：

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.

 

题意：

给出一个序列，求序列中的（严格）最长上升子序列。LIS

 

分析：

1.LIS。求最长上升子序列

2. 要考虑时间复杂度。因为n为1000000，如果用n^2的算法肯定超时，所以要选择nlogn的算法。（百度的）,用二分找最优值

3.用cnt保存最长上升子序列的值。b[cnt++]=a[i]

 

代码：

 #include<cstdio>
 #include<iostream>
 using namespace std;

 const int maxn=;

 int i;
 int n,cnt;
 int a[maxn],b[maxn];

 int LIS()
 {
     cnt=;
     b[]=;
     for(i=;i<n;i++)
     {
         if(cnt==||a[i]>b[cnt])
         {
             cnt++;
             b[cnt]=a[i];  //保存最长上升子序列的个数
         }
         else
         {
             int l=,r=cnt;
             while(l<=r)  //二分比较a[]和b[]中值的大小关系
             {
                 int mid=(l+r)/;
                 if(a[i]>b[mid])
                     l=mid+;
                 else
                     r=mid-;
             }
             b[l]=a[i];

         }
     }
     return cnt;
 }

 int main()
 {
     while(scanf("%d",&n)!=EOF)
     {
         for(i=;i<n;i++)
             scanf("%d",&a[i]);
         LIS();
         printf("%d\n",cnt);
     }
     return ;
 }

开始调试的时候，只要输入一个数就输出1，一直没有找出来错误，找别人帮忙来看也没有找出，后来才发现是因为写的时候把scanf中的%d写成了d%，真是好坑啊。。。。。

下次一定要好好注意这些小地方