专题三1003

来源：互联网发布：ios微信多开软件编辑：程序博客网时间：2024/06/14 10:41

*题意

给定n个正整数标记的棋子，求这些棋子的上升子序列中标记和最大为多少

*解题思路

就是求上升子序列，然后将其中和最大的输出，用sun[i]记录每个棋子num[i]与其前面的棋子组成的上升子序列的和，通过判断后面的棋子num[i]是否大于前面的棋子num[j]；大于则sum[i]+=num[j];用ans记录最大的sum[i];最后输出sum[i]即可

*感想

题目很长，但是大多数都是废话

*源码

#include <iostream>
using namespace std;
const int maxn=1002;
 int num[maxn];
 int sum[maxn];
 int n;
 int main()
 {
 while(scanf("%d",&n)!=EOF&&n)
 {
 for(int i=1;i<=n;i++)
 cin>>num[i];
 sum[1]=num[1];
 int ans=sum[1];
 for(int i=2;i<=n;i++)
 {
 sum[i]=num[i];
 for(int j=1;j<i;j++)
 {
 if(num[j]<num[i]&&(sum[j]+num[i]>sum[i]))
 sum[i]=sum[j]+num[i];
 }
 if(ans<sum[i])
 ans=sum[i];
 }
 cout<<ans<<endl;
 }
 return 0;
 }

Problem C

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

Total Submission(s) : 116 Accepted Submission(s) : 52

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 24 1 2 3 44 3 3 2 10

Sample Output

Statistic |Submit | Back

1 0