Codeforces 294B - Shaass and Bookshelf 讲解(必看）

最新推荐文章于 2024-10-02 22:45:05 发布

阿史大杯茶

最新推荐文章于 2024-10-02 22:45:05 发布

阅读量138

点赞数 8

分类专栏：算法-DP 文章标签：算法 c++ 动态规划

本文链接：https://blog.csdn.net/weixin_66946161/article/details/128729105

版权

算法-DP 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

蒟蒻来讲题，还望大家喜。若哪有问题，大家尽可提！

Hello, 大家好哇！本初中生蒟蒻今天来讲一下Codeforces 294B - Shaass and Bookshelf ！

=================================================

原题

Shaass has n books. He wants to make a bookshelf for all his books. He wants the bookshelf’s dimensions to be as small as possible. The thickness of the i-th book is ti and its pages’ width is equal to wi. The thickness of each book is either 1 or 2. All books have the same page heights.

在这里插入图片描述

Shaass puts the books on the bookshelf in the following way. First he selects some of the books and put them vertically. Then he puts the rest of the books horizontally above the vertical books. The sum of the widths of the horizontal books must be no more than the total thickness of the vertical books. A sample arrangement of the books is depicted in the figure.
在这里插入图片描述

Help Shaass to find the minimum total thickness of the vertical books that we can achieve.

Input
The first line of the input contains an integer n, (1 ≤ n ≤ 100). Each of the next n lines contains two integers ti and wi denoting the thickness and width of the i-th book correspondingly, ( $\leq ti \leq 2, 1 \leq wi \leq100$ ).

Output
On the only line of the output print the minimum total thickness of the vertical books that we can achieve.

思路

这道题就可以用动态规划了，这里我们采用闫氏分析法（如图1.1）：
图（1.1）
这道题就是个01背包，要么书竖着摆，要么横着摆。厚度为重量，宽度为价值，就能如图推出以下方程式：

$f_{i, j} = min(f_{i, j - t_{i}}, f_{i, j} + w_{i})$

最后，输出的时候要把厚度都枚举一遍，判断该厚度所对应的宽度是否小于等于该厚度，若可以： $res = min(res, f_{n, i})$

代码

#include <iostream>
#include <cstring>

using namespace std;

const int N = 1e2 + 10, M = 2e2 + 10;

int n, sumt;
int t[N], w[N];
int f[N][M];

int main()
{
	cin >> n;
	
	for (int i = 1; i <= n; i ++)
		cin >> t[i] >> w[i], sumt += t[i];
	
	memset(f, 0x3f, sizeof f);
	f[0][0] = 0;
	for (int i = 1; i <= n; i ++)
		for (int j = sumt; j >= 0; j --)
			f[i][j] = min((j >= t[i]) ? f[i - 1][j - t[i]] : 0x3f3f3f3f, f[i - 1][j] + w[i]);
			
	int res = 0x3f3f3f3f;
	for (int j = 0; j <= sumt; j ++)
		if (j >= f[n][j])
			res = min(res, j);
			
	cout << res << endl;
	return 0;
}