最经典的最长上升子序列问题【LIS】【垃圾死啦都】
来源:互联网 发布:import java 编辑:程序博客网 时间:2024/06/03 21:04
声明:本次博文主要是讲的是关于最长上升子序列的问题,简称【LIS问题】都是一些入门题,板子题,勿喷,具体算法分析请自行百度 即:
POJ - 3903 - Stock Exchange
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 7220 Accepted: 2518
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.
Source
Southeastern European Regional Programming Contest 2008
题意: LIS的板子题,就是求一个数列的最长上升子序列,严格递增哦
#include <cstdio>#include <algorithm>#include <iostream>using namespace std;const int N = 1e5 + 10;int a[N],b[N];int binary(int x,int rr){ int l = 0,r = rr,ans; while(l <= r){ int mid = l + r >> 1; if(b[mid] >= x) ans = mid,r = mid - 1; else l = mid + 1; } return ans;}int main(){ ios_base::sync_with_stdio(0); int n; while(cin>>n){ for(int i = 1; i <= n;i++){ cin>>a[i]; } int len = 1; b[1] = a[1]; for(int i = 2;i <= n;i++){ if(a[i] > b[len]){ b[++len] = a[i]; } else { int t = binary(a[i],len);//也可以用c++自带的lower_pound,自写也可以 b[t] = a[i]; } } cout<<len<<endl; } return 0;}
- 如有错误或遗漏,请私聊下UP,ths
- 最经典的最长上升子序列问题【LIS】【垃圾死啦都】
- LIS求解最长上升子序列问题
- 最长上升子序列(LIS)问题
- 最长上升子序列(LIS)问题
- lis求最长上升子序列问题
- 最长上升子序列问题 (LIS)
- 最长上升子序列问题(LIS)
- 最长上升子序列问题LIS
- LIS 最长严格上升子序列问题
- 最长上升子序列问题(LIS)
- 最长上升子序列问题(LIS)
- 最长上升子序列问题(LIS)
- 关于最长上升子序列的问题(LIS)
- 最长上升子序列(LIS)的求法
- 最长上升子序列LIS
- 最长上升子序列LIS
- 最长上升子序列(LIS)
- 最长上升子序列 LIS
- 虚拟机安装mac 在开机页面无限重启
- 汉诺塔问题
- STM32 GPIO初始化步骤
- C#控制台基础 将十六进制的字符串 转换成 十进制数
- 学习日记-第一个Bootstrap页面总结
- 最经典的最长上升子序列问题【LIS】【垃圾死啦都】
- C#控制台基础 将byte类型以十六进制字符串的形式输出
- P1983 车站分级(拓扑排序)
- C++大数加法乘法
- css 文本超出添加省略号
- K:java枚举的常见用法
- 创建动画
- leetcode 448. Find All Numbers Disappeared in an Array
- C2065'not_equal_to': undeclared identifier