我在这里做下说明：
1、首先，我不帮你们翻译英语，我的英语也不好，请英语不好的硬着头皮看题目，看得懂的
2、1000MS是指1000毫秒也就是1秒，大家注意一下数据量
3、是中级题，不是初级题，有卡人的地方，需要良好的算法
有兴趣的来做，过几天我公布代码，写好的代码跟帖
Jumping Cows
Time Limit:1000MS Memory Limit:65536K
Description
Farmer John's cows would like to jump over the moon, just like the cows in their favorite nursery rhyme. Unfortunately, cows can not jump.
The local witch doctor has mixed up P (1 <= P <= 150,000) potions to aid the cows in their quest to jump. These potions must be administered exactly in the order they were created, though some may be skipped.
Each potion has a 'strength' (1 <= strength <= 500) that enhances the cows' jumping ability. Taking a potion during an odd time step increases the cows' jump; taking a potion during an even time step decreases the jump. Before taking any potions the cows' jumping ability is, of course, 0.
No potion can be taken twice, and once the cow has begun taking potions, one potion must be taken during each time step, starting at time 1. One or more potions may be skipped in each turn.
Determine which potions to take to get the highest jump.
Input
* Line 1: A single integer, P
* Lines 2..P+1: Each line contains a single integer that is the strength of a potion. Line 2 gives the strength of the first potion; line 3 gives the strength of the second potion; and so on.
Output
* Line 1: A single integer that is the maximum possible jump.
Sample Input
8
7
2
1
8
4
3
5
6
Sample Output
17
[此贴子已经被作者于2006-3-15 22:39:18编辑过]
