hdu 1087 Super Jumping! Jumping! Jumping!
2015-04-25 19:54
399 查看
给出一个序列,求所有上升序列中和最大的一个值m,(该序列不一定连续)
例如4 1 3 2 4这组数据的结果为8
例如4 1 3 2 4这组数据的结果为8
#include<iostream> #include<cstring> #define maxn 1000+5 using namespace std; int rem[maxn],dp[maxn]; int main() { int n; while(cin>>n&&n) { for(int i=0;i<n;i++) cin>>rem[i]; memset(dp,0,sizeof(dp)); dp[0]=rem[0]; int re=rem[0]; for(int i=1;i<n;i++) { int sum=0; for(int j=0;j<i;j++) { if(rem[i]>rem[j]) sum=max(sum,dp[j]); } dp[i]=sum+rem[i]; re=max(re,dp[i]); } cout<<re<<endl; } return 0; }
相关文章推荐
- hdu 1087 - Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU-1087(Super Jumping! Jumping! Jumping!)
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! ( 求序列的最大上升序列 )
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!【最大递增子段和】
- HDU-1087 Super Jumping! Jumping! Jumping! (线性dp 上升子序列最大和)
- [HDU 1087]Super Jumping! Jumping! Jumping!(类LIS DP)
- HDU——1087 Super Jumping! Jumping! Jumping!
- hdu1087——Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- 动态规划HDU-1087 Super Jumping! Jumping! Jumping!
- [HDU - 1087]Super Jumping! Jumping! Jumping!(动态规划)
- hdu 1087 Super Jumping! Jumping! Jumping!(LIS变形题,求上升子序列的最大和)
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU1087 Super Jumping! Jumping! Jumping! 最大连续递增子段
- HDU 1087 Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping! (DP,水题)