HDU1087 Super Jumping! Jumping! Jumping!(LIS)
2014-12-22 18:48
225 查看
题目意思:
http://acm.hdu.edu.cn/showproblem.php?pid=1087
此题的意思求最长上升子序列的和。
题目分析:
在求最长上升子序列的时候,不在保存最长的个数,而是保存他们的和即可。
AC代码:
/**
*最长上升子序列问题+保存得到的分数
*/
#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<cstdlib>
#include<cctype>
#include<cstring>
#include<cmath>
using namespace std;
int a[1005],dp[1005];
int LIS(int n,int a[]){//O(n*n)
int ma=0;
for(int i=0;i<n;i++){
dp[i]=a[i];
if(ma<dp[i]) ma=dp[i];
for(int j=0;j<i;j++){
if(a[j]<a[i]&&dp[j]+a[i]>dp[i]){
dp[i]=dp[j]+a[i];
if(ma<dp[i]) ma=dp[i];
}
}
}
return ma;
}
int main()
{
int n;
while(cin>>n&&n){
for(int i=0;i<n;i++) cin>>a[i];
cout<<LIS(n,a)<<endl;
}
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=1087
此题的意思求最长上升子序列的和。
题目分析:
在求最长上升子序列的时候,不在保存最长的个数,而是保存他们的和即可。
AC代码:
/**
*最长上升子序列问题+保存得到的分数
*/
#include<iostream>
#include<cstdio>
#include<map>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<cstdlib>
#include<cctype>
#include<cstring>
#include<cmath>
using namespace std;
int a[1005],dp[1005];
int LIS(int n,int a[]){//O(n*n)
int ma=0;
for(int i=0;i<n;i++){
dp[i]=a[i];
if(ma<dp[i]) ma=dp[i];
for(int j=0;j<i;j++){
if(a[j]<a[i]&&dp[j]+a[i]>dp[i]){
dp[i]=dp[j]+a[i];
if(ma<dp[i]) ma=dp[i];
}
}
}
return ma;
}
int main()
{
int n;
while(cin>>n&&n){
for(int i=0;i<n;i++) cin>>a[i];
cout<<LIS(n,a)<<endl;
}
return 0;
}
相关文章推荐
- HDU 1087 Super Jumping! Jumping! Jumping! ——LIS
- HDU - 1087 Super Jumping! Jumping! Jumping! (简单LIS)
- 【HDU 1087 】Super Jumping! Jumping! Jumping! 【LIS 的变形】
- [LIS_最长递增子序列]-hdu 1087 Super Jumping!
- [HDU 1087]Super Jumping! Jumping! Jumping!(类LIS DP)
- HDU1087 Super Jumping! Jumping! Jumping!(LIS)
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)
- HDU - 1087 Super Jumping! Jumping! Jumping! (简单LIS)
- hdu 1087 Super Jumping! Jumping! Jumping! (LIS)
- HDU 1087 Super Jumping! Jumping! Jumping! (DP+LIS)
- 【hdu 1087】 Super Jumping! Jumping! Jumping! (LIS变形)
- 动态规划 ② HDU - 1087 Super Jumping! Jumping! Jumping! (LIS 最大上升子序列)
- HDU:1087 Super Jumping! Jumping! Jumping!(DP,LIS问题)
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS)
- HDU 1087:Super Jumping! Jumping! Jumping!(DP之LIS)
- Super Jumping! Jumping! Jumping!(hdu 1087 LIS变形)
- HDU-1087 Super Jumping! Jumping! Jumping!(LIS)
- hdu 1087 Super Jumping! Jumping! Jumping! (简单 LIS)
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu-1087 Super Jumping! Jumping! Jumping!(DP解法)