POJ 2181
来源:互联网 发布:经济评价软件破解版 编辑:程序博客网 时间:2024/06/13 23:58
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.
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.
* 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
872184356Sample Output
17Description
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.
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.
* 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 6Sample Output
17#include<cstdio>
#include<algorithm>
using namespace std;
#define M 150005
int dp[M][2][2],a[M];
int main()
{
int n;
while(~scanf("%d",&n))
{
for(int i=0;i<n;i++)
{
scanf("%d",a+i);
}
dp[0][0][0]=0;
dp[0][0][1]=-900000000;
dp[0][1][1]=a[0];
dp[0][1][0]=-900000000;
for(int i=1;i<n;i++)
{
dp[i][0][0]=max(dp[i-1][0][0],dp[i-1][1][0]);
dp[i][0][1]=max(dp[i-1][1][1],dp[i-1][0][1]);
dp[i][1][0]=max(dp[i-1][1][1],dp[i-1][0][1])-a[i];
dp[i][1][1]=max(dp[i-1][0][0],dp[i-1][1][0])+a[i];
}
printf("%d\n",max(max(dp[n-1][0][0],dp[n-1][0][1]),
max(dp[n-1][1][0],dp[n-1][1][1])));
}
return 0;
}
- POJ 2181
- poj 2181
- poj 2181
- POJ 2181简单DP
- POJ 2181-Jumping Cows
- poj 2181 (线段树)
- POJ 2181 Jumping Cows
- poj 2181_dp
- poj 2181 Jumping Cows
- poj 2181 Jumping Cows
- poj 2181 Jumping Cows
- POJ 2181 贪心
- poj 2181 DP
- poj 2181 Jumping Cows
- POJ
- poj
- POJ
- POJ
- android学习之ListView的用法简介
- CSS中加号、星号及其他符号的作用
- 青蛙的烦恼
- Android开发系列八:怎么混合显示图片和文本
- [归纳]PHP手册重读与整理-变量和常量
- POJ 2181
- POJ 2892 树状数组+二分
- hdu1348 凸包 jatvis卷包裹法 (此方法时间复杂度O(n^2))
- visual_studio_team_foundation_server_2010 下载
- 用户空间与内核空间数据交换的方式(1)------debugfs
- POJ 2352 线段树
- 用户空间与内核空间数据交换的方式(2)------procfs
- 用户空间与内核空间数据交换的方式(3)------模块参数与sysfs
- POJ 3928 Ping pong 树状数组