POJ 2533 Longest Ordered Subsequence(最长上升子序列)
2015-02-12 18:28
363 查看
最裸的求最长上升子序列的长度...题意完全是在说明什么事最长上升子序列233...
很简单的一个题目....很难得遇见这么裸的题目
很简单的一个题目....很难得遇见这么裸的题目
#include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<cstdlib> #include<cmath> using namespace std; int num[1234],dp[1234]; int main() { int n; while(cin>>n) { for(int i=1;i<=n;i++) cin>>num[i]; dp[0]=0; int ans=0; for(int i=1;i<=n;i++) { dp[i]=1; for(int j=0;j<i;j++) { if(num[i]>num[j]) dp[i]=max(dp[i],dp[j]+1); } ans=max(dp[i],ans); } cout<<ans<<endl; } return 0; }
相关文章推荐
- 【dp-LIS】牛客网 --最长上升子序列 POJ 2533--Longest Ordered Subsequence(LIS模板题)
- POJ2533 -Longest Ordered Subsequence最长上升子序列-动规和nlogn二分算法详解
- 每日三题-Day5-A(POJ 2533 Longest Ordered Subsequence 最长上升子序列O(nlogn)解法)
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- POJ - 2533 Longest Ordered Subsequence —— 最长不连续上升子序列
- 【POJ 2533】Longest Ordered Subsequence(最长上升子序列LIS)
- POJ - 2533 Longest Ordered Subsequence(最长上升子序列)
- Longest Increasing Subsequence[LIS 最长上升子序列问题] (Longest Ordered Subsequence) POJ - 2533 队列优化
- poj 2533 Longest Ordered Subsequence(LIS(最长上升子序列))
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(DP最长上升子序列O(n^2)&&O(nlogn))
- POJ 2533 Longest Ordered Subsequence(最长上升子序列O(n*n)解法)
- POJ 2533 Longest Ordered Subsequence 最长上升子序列
- poj 2533 Longest Ordered Subsequence (DP:最长上升子序列)
- POJ2533 Longest Ordered Subsequence (最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(最长上升子序列模版)
- poj2533-Longest Ordered Subsequence(最长上升子序列)
- Longest Ordered Subsequence POJ - 2533 (最长上升子序列)