SGU 183. Painting the balls( dp )

dp..dp(i, j)表示画两个点为i-j, i的最优答案. dp(i, j) = min{ dp(i-j, k) } + cost[i] (1≤k≤M-j)

令f(i, j) = min{dp(i, j)}, 那么转移时间下降为O(1).然后滚动数组..这道题卡空间..时间复杂度O(NM)

--------------------------------------------------------------------------------

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int maxn = 10001;

const int maxm = 101;

const int INF = 0x3F3F3F3F;

int dp[maxm], f[maxn][maxm], cost[maxn], N, M;

int main() {

memset(f, INF, sizeof f);

scanf("%d%d", &N, &M);

for(int i = 1; i <= N; i++) scanf("%d", cost + i);

int ans = INF;

for(int i = 1; i <= N; i++) {

if(i < M) f[i][0] = dp[0] = cost[i];

for(int j = 1; j <= M; j++) {

if(j > 1) f[i][j] = f[i][j - 1];

if(j > i) continue;

dp[j] = f[i - j][M - j];

if(i <= M) dp[j] = min(dp[j], f[i - j][0]);

f[i][j] = min(f[i][j], dp[j] += cost[i]);

if(N - i + j + 1 <= M) ans = min(ans, dp[j]);

}

printf("%d\n", ans);

return 0;

}

--------------------------------------------------------------------------------

183. Painting the balls

time limit per test: 0.25 sec.
memory limit per test: 4096 KB

input: standard input
output: standard output

Petya puts the N white balls in a line and now he wants to paint some of them in black, so that at least two black balls could be found among any M successive balls. Petya knows that he needs Ci milliliters of dye exactly to paint the i-th ball. Your task is to find out for Petya the minimum amount of dye he will need to paint the balls.

Input

The first line contains two integer numbers N and M (2<=N<=10000, 2<=M<=100, M<=N). The second line contains N integer numbers C1, C2, ..., CN (1<=Ci<=10000).

Output

Output only one integer number - the minimum amount of dye Petya will need (in milliliters).

Sample test(s)

Input

6 3
1 5 6 2 1 3

Output

Note

Example note: 1, 2, 4, 5 balls must be painted.

[submit]

[forum]

转载于:https://www.cnblogs.com/JSZX11556/p/4797697.html

SGU 183. Painting the balls( dp )相关推荐

SGU 183 Painting the balls
题目描述小宝把\(N\)个白球排成一列,他想把一些白球刷为黑色,且任意连续\(m\)个球中至少要有\(2\)个黑球. 小宝知道他需要\(C_i\)的染料刷第\(i\)个球.请你帮小宝算算他最少需要多 ...
[洛谷 P4084 USACO17DEC] Barn Painting G (树形dp经典)
[洛谷 P4084 USACO17DEC] Barn Painting G 题目链接大致题意: 给定一颗N个节点组成的树,3种颜色,其中K个节点已染色,要求任意两相邻节点颜色不同,求合法染色方案数 ...
【洛谷P4084】Barn Painting【树形DP】
题目大意: 题目链接:https://www.luogu.org/problemnew/show/P4084 一棵nnn个节点的树上有kkk个点已被染色.求将这棵树染成三种颜色且相邻的节点颜色不同的方 ...
史上最全的SGU题目分类
由于SGU上神题遍地,特列此表,便于训练时分类训练. 101 Domino 欧拉路 102 Coprime 枚举/数学方法 103 Traffic Lights 最短路 104 Little Shop ...
Educational Codeforces Round 67 (Rated for Div. 2)(D思维题线段树/E树形dp(换根dp) 二次扫描与换根法)
心得 D写了个假算法被hack了wtcl- E据涛神说是二次扫描与换根法,看了看好像和树形dp差不多 F概率dp G费用流回头再补思路来源马老师归神贤神等代码 http://www.mami ...
《题目与解读》红书训练笔记目录《ACM国际大学生程序设计竞赛题目与解读》
虽然2012年出版的老书了,但是是由三次世界冠军的上海交大ACM队出版的书籍,选择的题目是ACM经典中的经典,书中有非常详细的题解,可以学到很多东西,值得一刷. 目录第一部分第一章数学 1.1 ...
动态规划选讲 8.15
动态规划选讲 8.15 动态规划选讲 815 地精部落SDOI 2010 打砖块另一个打砖块 TreePOJ 1848 Painting the ballsSGU183 CF 611D 洪水概率DP ...
python不同目录调用_python3 不同目录间模块调用
#Author by Andy #_*_ coding:utf-8 _*_ #__file__获取当前程序的相对路径 import os,sys #print(__file__) # os.path. ...
WPF基础到企业应用系列8——依赖属性之“风云再起”
一. 摘要首先圣殿骑士很高兴"WPF 基础到企业应用系列" 能得到大家的关注.支持和认可.看到很多朋友留言希望加快速度的问题,我会尽力的,对你们的热情关注也表示由衷的感谢.这段时 ...

SGU 183. Painting the balls( dp )

183. Painting the balls

SGU 183. Painting the balls( dp )相关推荐

最新文章

热门文章