hdu 1087 Super Jumping! Jumping! Jumping!
来源:互联网 发布:喵萝捏脸数据 百度云 编辑:程序博客网 时间:2024/06/17 15:01
就是求和最大的上升子序列(可以间断)。
#include <iostream>#include<stdio.h>#include<cstring>using namespace std;int a[1005],d[1005];int main(){ int n,i,j,max,m; while(scanf("%d",&n),n) {int max=-1100; m=0; memset(d,0,sizeof(d)); for(i=0;i<n;i++) { scanf("%d",&a[i]); d[0]=a[0]; m=0; for(j=0;j<i;j++) { if(d[j]>=m&&a[j]<a[i]) m=d[j]; } d[i]=m+a[i]; if(d[i]>max) max=d[i]; } printf("%d\n",max); } return 0;}
- hdu/hdoj 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!
- 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!
- hdu 1087 Super Jumping! Jumping! Jumping!
- hdu 1087 Super Jumping! Jumping! Jumping! DP
- POJ 1611 The Suspects
- POJ 1308 Is It A Tree?
- hdu 1051 Wooden Sticks
- ZOJ 1307 Packets
- hdu 1159 Common Subsequence
- hdu 1087 Super Jumping! Jumping! Jumping!
- jQuery定义自己函数
- hdu 1003 Max Sum
- Codeforces Purification
- hdu 2181 哈密顿绕行世界问题 - 搜索
- Burning Midnight Oil
- poj 1979 Red and Black - bfs
- 分析函数
- hdu 1241 Oil Deposits - bfs