最大连续数

最新推荐文章于 2022-05-14 23:08:21 发布

原创最新推荐文章于 2022-05-14 23:08:21 发布 · 364 阅读

0 ·

CC 4.0 BY-SA版权

dp 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种流行的游戏——超级跳跃！跳！跳！如何通过优化跳跃路径来获得最高分数的方法。玩家从起点出发，目标是到达终点，必须遵循跳跃路径上的棋子大小递增的原则，无法后退。游戏的得分来自于跳跃路径上棋子的数值之和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Sample Output

4
10
3

一个一个判断 每加一个 加上前面比他小的 逐个判断 每次做记得数组开大一点 不然不ac
#include<iostream>
#include<string.h>
#include<set>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
#include<string.h>
#include<sstream>
#include<stdio.h>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<iomanip>
#include<cstdio>
using namespace std;
int main()
{
    int t;
    int i;

    int x;
    int pao[1005];
    int a[1005];
    while(cin>>t&&t!=0)
    {
        memset(pao,0,sizeof(pao));
       for(i=1;i<=t;i++)
        {
            cin>>a[i];
        }
       pao[1]=a[1];
       int j;
       int max;
       for(i=2;i<=t;i++)
       {
           pao[i]=a[i];
           for(j=i-1;j>=1;j--)
           {
               if(a[i]>a[j])
              {
                  max=pao[j]+a[i];
                  if(max>pao[i])
                  {
                      pao[i]=max;
                  }
              }
           }
       }
       sort(pao+1,pao+t+1);
       cout<<pao[t]<<endl;
    }

    return 0;
}