POJ3661——Running

最新推荐文章于 2021-03-23 04:31:44 发布

tokers

最新推荐文章于 2021-03-23 04:31:44 发布

阅读量764

点赞数

分类专栏： POJ 之旅 DP 文章标签： dp

本文链接：https://blog.csdn.net/Guard_Mine/article/details/41019951

版权

DP 同时被 2 个专栏收录

194 篇文章 0 订阅

订阅专栏

POJ 之旅

175 篇文章 0 订阅

订阅专栏

Running

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5232		Accepted: 1938

Description

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 D_i (1 ≤ D_i ≤ 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.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 contains the single integer: D_i

Output

* Line 1: A single integer representing the largest distance Bessie can run while satisfying the conditions.
　

Sample Input

Sample Output

Source

USACO 2008 January Silver

区间dp，我是这么做的：设dp[i]表示从i分钟到n分钟，最多可以达到的距离
关于状态方程我调了好久才对
关键是要在区间[i,n]中找到一个时间点k，k之前一直跑，中间一段时间是休息的，然后加上一个子区间的dp值

#include <map>  
#include <set>  
#include <list>  
#include <stack>  
#include <queue>  
#include <vector>  
#include <cmath>  
#include <cstdio>  
#include <cstring>  
#include <iostream>  
#include <algorithm>  
  
using namespace std;

const int N = 10010;
int dp[N];
int d[N];
int sum[N];

int main()
{
	int n, m;
	while (~scanf("%d%d", &n, &m))
	{
		memset (dp, 0, sizeof(dp));
		sum[0] = 0;
		for (int i = 1; i <= n; ++i)
		{
			scanf("%d", &d[i]);
			sum[i] = sum[i - 1] + d[i];
		}
		for (int i = n - 1; i >= 1; --i)
		{
			for (int k = 0; k <= m; ++k)
			{
				if (k == 0)
				{
					dp[i] = max(dp[i], dp[i + 1]);
					continue;
				}
				if (i + 2 * k - 1 <= n)
				{
					dp[i] = max(dp[i], sum[k + i - 1] - sum[i - 1] + dp[i + 2 * k]);
				}
			}
		//	printf("dp[%d] = %d\n", i, dp[i]);
		}
		int ans = 0;
		for (int i = 1; i <= n; ++i)
		{
			ans = max(ans, dp[i]);
		}
		printf("%d\n", ans);
	}
	return 0;
}