HDOJ 1087Super Jumping! Jumping! Jumping!解题报告
来源:互联网 发布:淘宝网棉麻长裙 编辑:程序博客网 时间:2024/06/05 19:22
本题就是一个dp的入门题,就是求最长上升子序列的和.....代码如下
#include <stdio.h>#include <stdlib.h>#define N 1005int a[N];int dp[N];int main(){ int cases,i,j,n; int count=1; while(scanf("%d",&n) && n!=0) { int ans=0; for(i=1;i<=n;i++){ scanf("%d",&a[i]); dp[i]=a[i]; } for(i=2;i<=n;i++){ for(j=1;j<=i-1;j++){ if(a[j]<a[i] && dp[j]+a[i]>dp[i]) dp[i]=dp[j]+a[i]; } } for(i=1;i<=n;i++){ if(dp[i]>ans) ans=dp[i]; } printf("%d\n",ans); } return 0;}
0 0
- HDOJ 1087:Super Jumping! Jumping! Jumping!解题报告
- HDOJ-1087-Super Jumping! Jumping! Jumping! 解题报告
- HDOJ 1087Super Jumping! Jumping! Jumping!解题报告
- hdu 1087 解题报告 Super Jumping! Jumping! Jumping!
- HDU - 1087 Super Jumping! Jumping! Jumping! 解题报告
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdu/hdoj 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping! 【LIS】
- hdoj 1087Super Jumping! Jumping! Jumping!【dp】
- hdoj 1087Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!
- HDOJ-1087 Super Jumping! Jumping! Jumping!
- react.js-07-组件点击
- 数据迁移脚本
- vmdk迁移到ESXI方案
- Category添加属性字段
- 【最小生成树】【并查集】[USACO2016 金组]Fenced In
- HDOJ 1087Super Jumping! Jumping! Jumping!解题报告
- STL-关联式容器
- 网络运维—— 网络访问问题排查
- Android MVVM的沉思
- <<The R Inferno中文版>>写在前面
- CV视觉网
- POJ3126Prime Path
- react.js-08-state
- 完全二叉树节点数