HDU 动态规划 C

时间：2016-04-26 12:23:01 阅读：164 评论：0 收藏：0 [点我收藏+]

标签：

Problem C

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 26 Accepted Submission(s) : 4

Problem Description

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. <center><img src=/data/images/1087-1.jpg></center> 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.

Input

Input contains multiple test cases. Each test case is described in a line as follow: 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.

Output

For each case, print the maximum according to rules, and one line one case.

Sample Input

3 1 3 2

4 1 2 3 4

4 3 3 2 1

Sample Output

简单题意：

　　求最大的上升子序列的和，，，

思路分析：

　　dp 求解，，判断下一个数字是否成立：成立则 dp[i] = dp[j] + a[i];

#include <iostream>
#include <fstream>
#include <string>
#include <cstring>
using namespace std;
const int MAX = 1001;
int dp[MAX];
int a[MAX];
// 最大增序列
int main()
{
    //fstream cin("aaa.txt");
    int n;
    while(cin >> n)
    {
        if(!n)
        break;
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= n; i++)
        {
            cin >> a[i];
            dp[i] = a[i];
        }
        for(int i = 1; i <= n; i++)
            for(int j = 1; j < i; j++)
                if(a[j] < a[i] && dp[j] + a[i] > dp[i])
                    dp[i] = dp[j] + a[i];
        int max = -1000001;
        for(int i = 1; i <= n; i++)
        if(dp[i] > max)
            max = dp[i];
        cout << max << endl;
    }
    return 0;
}

HDU 动态规划 C

标签：

原文地址：http://www.cnblogs.com/lyf-acm/p/5434255.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行