Super Jumping! Jumping! Jumping! HDU
来源:互联网 发布:java action是什么 编辑:程序博客网 时间:2024/06/08 18:44
题目地址
Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.
The game can be played by two or more than two players. It consists of a chessboard(棋盘)and some chessmen(棋子), and all chessmen are marked by a positive integer or “start” or “end”. The player starts from start-point and must jumps into end-point finally. In the course of jumping, the player will visit the chessmen in the path, but everyone must jumps from one chessman to another absolutely bigger (you can assume start-point is a minimum and end-point is a maximum.). And all players cannot go backwards. One jumping can go from a chessman to next, also can go across many chessmen, and even you can straightly get to end-point from start-point. Of course you get zero point in this situation. A player is a winner if and only if he can get a bigger score according to his jumping solution. Note that your score comes from the sum of value on the chessmen in you jumping path.
Your task is to output the maximum value according to the given chessmen list.
N value_1 value_2 …value_N
It is guarantied that N is not more than 1000 and all value_i are in the range of 32-int.
A test case starting with 0 terminates the input and this test case is not to be processed.
3 1 3 24 1 2 3 44 3 3 2 10
4103
题意:求最长递增子序列 模板题
#include <iostream>#include <algorithm>using namespace std;int main(void) { int n; while (cin >> n, n) { int a[1100] = {0}; for (int i = 0; i < n; i++) { cin >> a[i]; } int dp[1100] = {0}; for (int i = 0; i < n; i++) { dp[i] = a[i]; int maxn = 0; for (int j = 0; j < i; j++) { if (a[j] < a[i] && dp[j] > maxn) maxn = dp[j]; } dp[i] += maxn; } int maxn = 0; for (int i = 0; i < n; i++) { if (dp[i] > maxn) maxn = dp[i]; } cout << maxn << endl; } return 0;}
阅读全文
0 0
- HDU Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- hdu Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping! HDU
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- Super Jumping! Jumping! Jumping!
- 指定等级(一维数组实例)
- 泰勒公式的展开细节解析
- Android NDK开发二 cmake脚本编写
- 同步方法与同步块的区别
- 使用QSharedDataPointer报incomplete-type错误
- Super Jumping! Jumping! Jumping! HDU
- 算法之快速排序
- Squid.conf配置文件详解
- std::function 与 std::bind 的基础使用
- ImportError: No module named incremental
- jps 查看HBase 启动的进程
- 2017下半年12场人工智能机器人科技大会合集汇总【活动家】
- Java 机器学习库Smile实战(一)SVM
- scikit-learn 线性回归算法库小结