时间限制:C/C++ 1秒,其他语言2秒
空间限制:C/C++ 32768K,其他语言65536K
64bit IO Format: %lld
题目描述
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.
输入描述:
- Line 1: Two space-separated integers: N and M
- Lines 2…N+1: Line i+1 contains the single integer: Di
输出描述:
- Line 1: A single integer representing the largest distance Bessie can run while satisfying the conditions.
示例1
输入
5 2
5
3
4
2
10
输出
9
说明
Bessie runs during the first minute (distance=5), rests during the second minute, runs for the third (distance=4), and rests for the fourth and fifth. Note that Bessie cannot run on the fifth minute because she would not end with a rest factor of 0.
题意:给出一串数字,获取最大的跑步路程而且不能疲惫。跑一次疲惫加1,休息一次疲惫减1。
解题思路:运用经典dp方式,加入疲惫的条件。
#include <bits/stdc++.h>
using namespace std;
int a[10005];
int dp[10005][505];
int n,m;
int main()
{
scanf("%d%d",&n,&m);
memset(a,0,sizeof a);
memset(dp,0,sizeof dp);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
for(int i=1; i<=n; i++)
for(int j=1; j<=min(i,m); j++)
{
dp[i][0]=max(dp[i-j][j],max(dp[i][0],dp[i-1][0]));//三种可能的遍历方向
dp[i][j]=dp[i-1][j-1]+a[i];
}
cout<<dp[n][0];
return 0;
}