I-Simple DP example extension
crawling in process ... crawling failed time limit:1000MS Memory Limit:32768KB 64bit IO Format:%i64d &%i64u
Submit Status
Description
Nowadays, a kind of chess game called "Super jumping! jumping! Jumping! "is very popular in HDU. Maybe you is a good boy, and know little about the this game, so I introduce it to you now.
The game can be played by and more than the players. It consists of a chessboard (chessboard) and some chessmen (chess pieces), and all chessmen is marked by a positive integer or "start" or "End ”. The player starts from start-point and must jumps to end-point finally. In the course of jumping, the player would visit the chessmen in the path, but everyone must jumps from one Chessman to Ano Ther absolutely bigger (you can assume start-point are 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 can straightly get to end-point From Start-point. Of course you get the 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 was described in a line as follow:
N value_1 value_2 ... value_n
It is guarantied, that N was not more than, and all value_i be in the range of 32-int.
A test case, starting with 0 terminates, the input and this test are not 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
4103 Thinking Analysis: Simple DP, state transfer equation if (A[i]>a[j]) Dp[i]=max (Dp[i],a[i]+dp[j]) code: #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
using namespace Std;
const int maxn=1000+100;
int DP[MAXN],A[MAXN];
const int INF=0XFFFFFFF;
int main ()
{
int n;
while (scanf ("%d", &n)!=eof&&n)
{
Memset (Dp,0,sizeof (DP));
for (int i=1;i<=n;i++)
scanf ("%d", &a[i]);
DP[1]=A[1];
int ma=-inf;
for (int i=2;i<=n;i++)
{
Dp[i]=a[i];
for (int j=i-1;j>=1;j--)
{
if (A[i]>a[j])
Dp[i]=max (Dp[i],a[i]+dp[j]);
}
if (DP[I]>MA)
Ma=dp[i];
}
cout<<ma<<endl;
}
return 0;
}
hdu1087 Simple DP
