hdoj 1087
2013-04-28 20:03
253 查看
#include<iostream> #include<stdio.h> using namespace std; #define MAX 1008 //#define MAX 10 int N; int s[MAX]; int b[MAX]; int maxx; int max(int a,int b) { if(a>b) return a; else return b; } void dp() { int i,j; for(i=0;i<=N;i++) { for(j=i;j<=N;j++) { //判断是否合理 if(s[j]>s[i]) { b[j]=max(b[j],b[i]+s[j]); if(b[j]>maxx) { maxx=b[j]; } } } } } int main() { //freopen("in.txt","r",stdin); while(scanf("%d",&N)) { if(N==0) return 0; int i=0;s[1]=0;s =MAX; for(i=1;i<=N;i++) scanf("%d",&s[i]); memset(b,0,sizeof(b)); maxx=0; dp(); printf("%d\n",maxx); } return 0; }
相关文章推荐
- hdoj 1087 Super Jumping! Jumping! Jumping!
- hdoj1087
- HDOJ1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087 Super Jumping! Jumping! Jumping! 杭电 ACM
- HDOJ-1087-Super Jumping! Jumping! Jumping! 解题报告
- HDOJ 题目1087Super Jumping! Jumping! Jumping!(动态规划)
- hdoj--1087--Super Jumping! Jumping! Jumping!(最长上升序列)
- HDOJ 1087 求最大递增子序列的和(动态规划)
- HDOJ 1087 Super Jumping! Jumping! Jumping!
- HDOJ 1087
- hdoj--1087--Super Jumping! Jumping! Jumping!(贪心)
- HDOJ 1087 Super Jumping! Jumping! Jumping! (dp)
- hdoj 1087 Super Jumping! Jumping! Jumping!
- hdoj 1087 Super Jumping! Jumping! Jumping!(最大递增子段和)
- hdu 1087 hdoj 1087
- 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! (DP)