动态规划【Longest Ordered Subsequence】
2014-04-25 20:43
337 查看
Description
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, 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 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 file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
Sample Output
4
最长不下降子序列
示例分析:
1 2 2 3 4 3 4
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int a[1005],dp[1005],n;
int LIS()
{
int i,j,ans,m;
dp[1] = 1;
ans = 1;
for(i = 2;i<=n;i++)
{
m = 0;
for(j = 1;j<i;j++)
{
if(dp[j]>m && a[j]<a[i])
m = dp[j];
}
dp[i] = m+1;
if(dp[i]>ans)
ans = dp[i];
}
return ans;
}
int main()
{
int i;
while(~scanf("%d",&n))
{
for(i = 1;i<=n;i++)
scanf("%d",&a[i]);
printf("%d\n",LIS());
}
return 0;
}
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, 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 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 file contains the length of sequence N. The second line contains the elements of sequence - N integers in the range from 0 to 10000 each, separated by spaces. 1 <= N <= 1000
Output
Output file must contain a single integer - the length of the longest ordered subsequence of the given sequence.
Sample Input
7 1 7 3 5 9 4 8
Sample Output
4
最长不下降子序列
示例分析:
1 7 3 5 9 4 8
1 2 2 3 4 3 4
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int a[1005],dp[1005],n;
int LIS()
{
int i,j,ans,m;
dp[1] = 1;
ans = 1;
for(i = 2;i<=n;i++)
{
m = 0;
for(j = 1;j<i;j++)
{
if(dp[j]>m && a[j]<a[i])
m = dp[j];
}
dp[i] = m+1;
if(dp[i]>ans)
ans = dp[i];
}
return ans;
}
int main()
{
int i;
while(~scanf("%d",&n))
{
for(i = 1;i<=n;i++)
scanf("%d",&a[i]);
printf("%d\n",LIS());
}
return 0;
}
相关文章推荐
- E - Longest Ordered Subsequence(动态规划)最长升成子序列问题
- 动态规划 Longest Ordered Subsequence
- [POJ - 2533] Longest Ordered Subsequence(动态规划)
- POJ 2533-Longest Ordered Subsequence 动态规划
- acm pku 2533 Longest Ordered Subsequence 动态规划
- poj入门水题--动态规划(DP)2533 Longest Ordered Subsequence 1088滑雪
- POJ-2533-Longest Ordered Subsequence-最长递增子序列-动态规划
- Longest Ordered Subsequence POJ - 2533(dp动态规划)
- POJ2533 Longest Ordered Subsequence (动态规划)
- poj 动态规划DP - 2533 Longest Ordered Subsequence
- 【蓝桥杯-动态规划】 Longest Ordered Subsequence
- POJ2533:Longest Ordered Subsequence(LIS) 动态规划
- POJ 2533 Longest Ordered Subsequence(DP动态规划)
- POJ 2533 Longest Ordered Subsequence (DP动态规划)
- CSU-ACM2017暑期训练8-动态规划初步 D - Longest Ordered Subsequence
- POJ - 2533 Longest Ordered Subsequence —— 最长不连续上升子序列
- [POJ]2533 Longest Ordered Subsequence
- POJ2533 Longest ordered subsequence
- POJ 2533 Longest Ordered Subsequence
- poj2533 Longest Ordered Subsequence