POJ 2533 Longest Ordered Subsequence
来源:互联网 发布:php变量覆盖 编辑:程序博客网 时间:2024/05/08 19:28
题意:已知一个长度为n的序列,求一个最长上升子序列的长度
链接:http://poj.org/problem?id=2533
思路:简单的LIS序列,状态转移方程 num[i] > num[j] ? dp[i] = max ( dp[i], dp[j] + 1 ) : dp[i] = dp[i];
注意点:无
以下为AC代码:
Run IDUserProblemResultMemoryTimeLanguageCode LengthSubmit Time14186562luminous112533Accepted688K0MSG++2901B2015-05-12 15:01:23#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <iostream>#include <cstring>#include <cstdio>#include <string>#include <vector>#include <deque>#include <list>#include <map>#include <set>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <cctype>#include <climits>#include <iomanip>#include <cstdlib>#include <algorithm>//#include <unordered_map>//#include <unordered_set>#define ll long long#define ull unsigned long long#define all(x) (x).begin(), (x).end()#define clr(a, v) memset( a , v , sizeof(a) )#define pb push_back#define RDI(a) scanf ( "%d", &a )#define RDII(a, b) scanf ( "%d%d", &a, &b )#define RDIII(a, b, c) scanf ( "%d%d%d", &a, &b, &c )#define RS(s) scanf ( "%s", s )#define PI(a) printf ( "%d", a )#define PIL(a) printf ( "%d\n", a )#define PII(a,b) printf ( "%d %d", a, b )#define PIIL(a,b) printf ( "%d %d\n", a, b )#define PIII(a,b,c) printf ( "%d %d %d", a, b, c )#define PIIIL(a,b,c) printf ( "%d %d %d\n", a, b, c )#define PL() printf ( "\n" )#define PSL(s) printf ( "%s\n", s )#define rep(i,m,n) for ( int i = m; i < n; i ++ )#define REP(i,m,n) for ( int i = m; i <= n; i ++ )#define dep(i,m,n) for ( int i = m; i > n; i -- )#define DEP(i,m,n) for ( int i = m; i >= n; i -- )#define repi(i,m,n,k) for ( int i = m; i < n; i += k )#define REPI(i,m,n,k) for ( int i = m; i <= n; i += k )#define depi(i,m,n,k) for ( int i = m; i > n; i += k )#define DEPI(i,m,n,k) for ( int i = m; i >= n; i -= k )#define READ(f) freopen(f, "r", stdin)#define WRITE(f) freopen(f, "w", stdout)using namespace std;const double pi = acos(-1);template <class T>inline bool RD ( T &ret ){ char c; int sgn; if ( c = getchar(), c ==EOF )return 0; //EOF while ( c != '-' && ( c < '0' || c > '9' ) ) c = getchar(); sgn = ( c == '-' ) ? -1 : 1; ret = ( c == '-' ) ? 0 : ( c - '0' ); while ( c = getchar() , c >= '0' && c <= '9' ) ret = ret * 10 + ( c - '0' ); ret *= sgn; return 1;}inline void PD ( int x ){ if ( x > 9 ) PD ( x / 10 ); putchar ( x % 10 + '0' );}const double eps = 1e-10;const int dir[4][2] = { 1,0, -1,0, 0,1, 0,-1 };struct node{ int x, y, cnt; node(){} node( int _x, int _y ) : x(_x), y(_y) {} node( int _x, int _y, int _cnt ) : x(_x), y(_y), cnt(_cnt) {}};int num[1000005];int dp[1000005];int main(){ int n; while ( RDI ( n ) != EOF ){ rep ( i, 0, n ){ RDI ( num[i] ); dp[i] = 1; } int ans = 0; rep ( i, 0, n ){ rep ( j, 0, i ){ if ( num[i] > num[j] ) dp[i] = max ( dp[i], dp[j] + 1 ); } ans = max ( dp[i], ans ); } PIL ( ans ); } return 0;}
0 0
- POJ 2533 Longest Ordered Subsequence
- poj 2533Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- Poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 : Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- 你离开了北京,从此没有人和我说话
- Reset与嵌入式系统应用的稳定性
- Xcode 6导出ipa时必须登入开发账号的绕过方法
- MCMC的reversible与irreversible的不同
- 医学开源配准软件Elastix手册(中文翻译)——第四章 transformix的使用
- POJ 2533 Longest Ordered Subsequence
- Template模式 模板模式
- 关于Matlab绘图的一点基础小结
- “生活”的考试,才是需要一辈子认真奋斗的事
- SQL Server优化50法
- APP使用QQ登录
- 程序是为了让人更省事
- 我们这一代人的困惑
- 九章算法面试题35 构造最大数