zoukankan      html  css  js  c++  java
  • HDU 1087 最长不下降子序列 LIS DP

    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. 

    InputInput 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. 
    OutputFor 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
    0

    Sample Output

    4
    10
    3


    用最朴素的LIS解决办法就可以ac。
    dp[i] = max(dp[i],dp[j]+arr[i])
    然后记录答案 ans = max(ans,dp[i]);
    输出ans就是答案了。
    #include <bits/stdc++.h>
    using namespace std;
    
    const int M = 1000+9;
    int arr[M],dp[M];
    
    int main()
    {
    	int n;
    	while(scanf("%d",&n) != EOF && n)
    	{
    		memset(dp,0,sizeof(dp));
    		int ans = -99999;
    		for(int i = 0; i < n; i++)
    			scanf("%d",&arr[i]);
    		
    		for(int i = 0; i < n; i++)
    		{
    			dp[i] = arr[i];
    			for(int j = 0; j < i; j++)
    			{
    				if(arr[i] > arr[j])
    					dp[i] = max(dp[j]+arr[i],dp[i]);
    			}
    			ans = max(ans,dp[i]);
    		}
    		printf("%d
    ",ans);
    	}
    	return 0;
    }
    
  • 相关阅读:
    linux常用网络命令
    linux常用命令
    内核驱动——符号表的导出
    内核模块传参
    *** No rule to make target 'param'. Stop. 的问题
    mmap操作荔枝派gpio v3s Linux
    交叉编译 -sh: ./xxx: not found 的问题
    linux驱动 第一个驱动
    ubuntu 16.04 开机脚本
    V3s录音 交叉编译alsa linux
  • 原文地址:https://www.cnblogs.com/stul/p/10345584.html
Copyright © 2011-2022 走看看