ZOJ2136-Longest Ordered Subsequence
来源:互联网 发布:程序员成长电影 编辑:程序博客网 时间:2024/05/23 14:19
A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, the sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e.g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences of this sequence are of length 4, e.g., (1, 3, 5, 8).
Your program, when given the numeric sequence, must find the length of its longest ordered subsequence.
Input
The first line of input contains the length of sequence N (1 <= N <= 1000). The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces.
Output
Output must contain a single integer - the length of the longest ordered subsequence of the given sequence.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between output blocks.
Sample Input
1
7
1 7 3 5 9 4 8
Sample Output
4
Source: Northeastern Europe 2002, Far-Eastern Subregion
题意:给出一串数字,找出最长上升子序列
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF=0x3f3f3f3f;int main(){ int t,cas=0; scanf("%d",&t); while(t--) { if(cas) printf("\n"); else cas=1; int n,cnt=1; scanf("%d",&n); int a[1005],b[1005]; for(int i=1;i<=n;i++) { scanf("%d",&a[i]); if(i==1) b[cnt++]=a[i]; else { int k=lower_bound(b+1,b+cnt,a[i])-b; if(k==cnt) b[cnt++]=a[i]; else b[k]=a[i]; } } printf("%d\n",cnt-1); } return 0;}
- ZOJ2136-Longest Ordered Subsequence
- ZOJ2136 Longest Ordered Subsequence【DP】
- poj2553 Longest Ordered Subsequence
- 2533--Longest Ordered Subsequence
- Longest Ordered Subsequence
- longest ordered subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence
- Longest Ordered Subsequence (P2533)
- POJ2533:Longest Ordered Subsequence
- POJ2533--Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- POJ2533---Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence
- #从源码到可执行程序
- 将博客搬至CSDN
- 实现堆排序
- JavaScript 基础知识整理
- linux学习笔记
- ZOJ2136-Longest Ordered Subsequence
- JAVA中是否存在内存泄漏
- js实验2.(2)制作二级菜单
- 面向对象设计五大原则SOLID
- GlusterFS文件系统弹性哈希算法
- bit byte 字 字节 关系 简列
- Swift分支语句--if语句
- Linux NFS 服务搭建
- Qt之文件操作