[Swust OJ 893]--Blocks

题目链接：http://acm.swust.edu.cn/problem/893/

Time limit(ms): 1000　　　　　　Memory limit(kb): 65535

 

Josh loves playing with blocks. Currently, he has N blocks, labeled 0 through N-1. The heights of all blocks are positive integers. More precisely, for each i, the height of block i is blockHeights[i]. Josh is interested in making the tallest block tower possible. He likes all his towers to follow three simple rules:

1.The blocks must be stacked in a single column, one atop another. The height of the tower is simply the sum of heights of all its blocks. 
2.The labels of blocks used in the tower must increase from the bottom to the top. In other words, whenever Josh places box x on top of box y, we have x > y.
3.Josh will never place a box of an even height on top of a box of an odd height. 
you need find out the height of the tallest possible block tower Josh can build.

Description

Each test case starts with a number N (0 < N <= 1000000) -- the total number of blocks,followed by N positive numbers.All the numbers in the input are less than 1000.A test case with N = 0 denotes the end of input. This test case is not to be processed.

Input

Print the tallest possible block tower on a single line for each test case.

Output

1 2 3 4 5 6

2 4 7 2 7 4 5 49 2 49 2 49

Sample Input

1 2 3

11 7 147

Sample Output

 

 

这题意思太纠结了，始终感觉迷迷糊糊的~~~~求大神解释下题意，下面有一段ac代码

 

#include <stdio.h>
int dp[1000002][2];
#define max(a,b) a>b?a:b
int main()
{
    int n, height, i;
    while (~scanf("%d", &n), n){
        for (i = 0; i < n; i++){
            scanf("%d", &height);
            if (height & 1){
                if (!i){
                    dp[i][0] = height;
                    dp[i][1] = 0;
                }
                else{
                    dp[i][0] = max(dp[i - 1][0] + height, dp[i - 1][1] + height);
                    dp[i][1] = dp[i - 1][1];
                }
            }
            else{
                if (!i){
                    dp[i][1] = height;
                    dp[i][0] = 0;
                }
                else{
                    dp[i][1] = dp[i - 1][1] + height;
                    dp[i][0] = dp[i - 1][0];
                }
            }
        }
        printf("%d
", max(dp[n - 1][0], dp[n - 1][1]));
    }
    return 0;
}