题目描述
The cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, she can choose to either run or rest for the whole minute.
The ultimate distance Bessie runs, though, depends on her 'exhaustion factor', which starts at 0. When she chooses to run in minute i, she will run exactly a distance of Di (1 ≤ Di ≤ 1,000) and her exhaustion factor will increase by 1 -- but must never be allowed to exceed M (1 ≤ M ≤ 500). If she chooses to rest, her exhaustion factor will decrease by 1 for each minute she rests. She cannot commence running again until her exhaustion factor reaches 0. At that point, she can choose to run or rest.
At the end of the N minute workout, Bessie's exaustion factor must be exactly 0, or she will not have enough energy left for the rest of the day.
Find the maximal distance Bessie can run.
奶牛们打算通过锻炼来培养自己的运动细胞，作为其中的一员，贝茜选择的运动方式是每天进行N(1 <= N <= 10,000)分钟的晨跑。在每分钟的开始，贝茜会选择下一分钟是用来跑步还是休息。
贝茜的体力限制了她跑步的距离。更具体地，如果贝茜选择在第i分钟内跑步，她可以在这一分钟内跑D_i(1 <= D_i <= 1,000)米，并且她的疲劳度会增加1。不过，无论何时贝茜的疲劳度都不能超过M(1 <= M <= 500)。如果贝茜选择休息，那么她的疲劳度就会每分钟减少1，但她必须休息到疲劳度恢复到0为止。在疲劳度为0时休息的话，疲劳度不会再变动。晨跑开始时，贝茜的疲劳度为0。
还有，在N分钟的锻炼结束时，贝茜的疲劳度也必须恢复到0，否则她将没有足够的精力来对付这一整天中剩下的事情。
请你计算一下，贝茜最多能跑多少米。
输入输出格式
输入格式：
第1行: 2个用空格隔开的整数：N 和 M
第2..N+1行: 第i+1为1个整数：D_i
输出格式：
输出1个整数，表示在满足所有限制条件的情况下，贝茜能跑的最大距离
输入输出样例
输入样例#1：
5 2
5
3
4
2
10
输出样例#1：
9
解题报告:
这..大水题啊,不知道为什么标签是贪心,题解里全是DP.
定义(f[i][j][0/1])为前i分钟,疲劳值为j,是否处于休息状态的最大距离.转移只要保证(f[i][j][0])不往(f[i][j][1]转移即可)
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#define RG register
#define il inline
#define iter iterator
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
using namespace std;
const int N=10005,M=505;
int f[N][M][2],a[N];
void work()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
memset(f,-127/3,sizeof(f));
int inf=f[0][0][0];
f[0][0][0]=0;f[0][0][1]=0;
for(int i=0;i<n;i++){
for(int j=0;j<=m;j++){
if(j==0){
if(f[i][j][0]!=inf)
f[i+1][j+1][1]=Max(f[i+1][j+1][1],f[i][j][0]+a[i+1]);
}
if(f[i][j][1]!=inf){
if(j<m)f[i+1][j+1][1]=Max(f[i][j][1]+a[i+1],f[i+1][j+1][1]);
int to=Max(j-1,0);
f[i+1][to][0]=Max(f[i+1][to][0],f[i][j][1]);
}
if(f[i][j][0]!=inf){
int to=Max(j-1,0);
f[i+1][to][0]=Max(f[i+1][to][0],f[i][j][0]);
}
}
}
printf("%d
",f[n][0][0]);
}
int main()
{
work();
return 0;
}