HDU 1087 Super Jumping! Jumping! Jumping! (基础dp)
来源:互联网 发布:最牛的请假条淘宝 编辑:程序博客网 时间:2024/06/01 09:34
/*基础dpE - Super Jumping! Jumping! Jumping!时间: 2017/02/20题意:最大递增子序列题解:dp[i] 表示以i为终点的递增子序列最大值dp[i] = max(dp[i],dp[j]+a[i]) {j < i}*/#include<cstdio>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>#include<queue>#include<map>using namespace std;#define N 1010#define INF 0x3f3f3f3fint dp[N],a[N];int main(){ int n; while(~scanf("%d",&n),n) { for(int i = 0; i < n; i++) scanf("%d",&a[i]); memset(dp,0,sizeof(dp)); int maxn = 0; for(int i = 0; i < n; i++) { dp[i] = a[i]; for(int j = i-1; j >= 0; j--) { if(a[i] > a[j]) dp[i] = max(dp[i],dp[j]+a[i]); } //printf("%d\n",dp[i]); maxn = max(maxn,dp[i]); } printf("%d\n",maxn); } return 0;}
0 0
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- hdu 1087 Super Jumping! Jumping! Jumping! ----dp
- HDU 1087 Super Jumping! Jumping! Jumping!(dp)
- Super Jumping! Jumping! Jumping! -HDU 1087 dp
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- [HDU 1087 Super Jumping! Jumping! Jumping!] DP
- DP-HDU-1087-Super Jumping!Jumping!Jumping!
- HDU-1087-DP-Super Jumping! Jumping! Jumping!
- HDU 1087 Super Jumping! Jumping! Jumping!(DP)
- hdu 1087 Super Jumping! Jumping! Jumping! dp
- HDU 1087 Super Jumping! Jumping! Jumping! DP
- HDU 1087 Super Jumping! Jumping! Jumping!【dp】
- HDU-1087 Super Jumping! Jumping! Jumping! (DP)
- HDU-1087 Super Jumping! Jumping! Jumping!(DP)
- Java IO流学习总结
- Servlet是线程安全的吗?
- 个人记录-LeetCode 90. Subsets II
- 计算机网络课程第一节课知识点
- PAT A1038 recover the smallest number (30)
- HDU 1087 Super Jumping! Jumping! Jumping! (基础dp)
- 极客学院----H5的相关笔记----css基础(二)
- omnet Program "g++" not found in PATH Program "gcc" not found in PATH
- HDU 1695 GCD (容斥原理)
- 设计模式学习之访问者模式
- 287. Find the Duplicate Number
- 微信小程序之基于canvas绘制高铁线路图
- 20170220找女朋友之路思考总结
- RMQ-洛谷P2216 [HAOI2007] 理想的正方形