Temple Build~dp（01背包的变形）

The Dwarves of Middle Earth are renowned for their delving and smithy ability, but they are also master builders. During the time of the dragons, the dwarves found that above ground the buildings that were most resistant to attack were truncated square pyramids (a square pyramid that does not go all the way up to a point, but instead has a flat square on top). The dwarves knew what the ideal building shape should be based on the height they wanted and the size of the square base at the top and bottom. They typically had three different sizes of cubic bricks with which to work. Their goal was to maximize the volume of such a building based on the following rules:

The building is constructed of layers; each layer is a single square of bricks of a single size. No part of any brick may extend out from the ideal shape, either to the sides or at the top. The resulting structure will have jagged sides and may be shorter than the ideal shape, but it must fit completely within the ideal design. The picture at the right is a vertical cross section of one such tower. There is no limit on how many bricks of each type can be used.

Input

Each line of input will contain six entries, each separated by a single space. The entries represent the ideal temple height, the size of the square base at the bottom, the size of the square base at the top (all three as non-negative integers less than or equal to one million), then three sizes of cubic bricks (all three as non-negative integers less than or equal to ten thousand). Input is terminated upon reaching end of file.

Output

For each line of input, output the maximum possible volume based on the given rules, one output per line.

Sample Input

500000 800000 300000 6931 11315 5000

Sample Output

160293750000000000

这题傻逼的我，居然一开始没有看出是一个01背包 ，
感觉这题的一个关键点就是用相似三角形求maxsize 这个限制条件
我比赛的时候根本想不到，用了其他方法处理了，出现了好多BUG

maxsize = top + (high - i) * (bottom - top) / high;
然后就是基本01背包的操作了

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <queue>
 5 #include <vector>
 6 using namespace std;
 7 typedef long long LL;
 8 LL high, bottom, top, s[3];
 9 int main() {
10     while(scanf("%lld%lld%lld%lld%lld%lld", &high, &bottom, &top, &s[0], &s[1], &s[2]) != EOF) {
11         LL ans = 0, maxsize;
12         vector<LL>best(high + 1, 0);
13         for (int i = 0 ; i <= high ; i++) {
14             maxsize = top + (high - i) * (bottom - top) / high;
15             best[i] = 0;
16             for (int j = 0 ; j < 3 ; j++ ) {
17                 if (i < s[j]) continue;
18                 LL temp = (maxsize / s[j]) * s[j];
19                 best[i] = max(best[i], temp * temp * s[j] + best[i - s[j]]);
20                 ans = max(ans, best[i]);
21             }
22         }
23         printf("%lld\n", ans);
24     }
25     return 0;
26 }

 

转载于:https://www.cnblogs.com/qldabiaoge/p/8877891.html