这是一道关于优化生日蛋糕组合的问题，Babaei需要将简单蛋糕堆叠起来，遵循体积递增的规则。他希望找出能获得最大总体积的蛋糕组合。输入包含蛋糕数量和每个蛋糕的半径及高度，输出要求是最大蛋糕体积，答案必须精确到10^-6。示例中展示了如何在不同情况下选择蛋糕以达到最大体积。
门
D. Babaei and Birthday Cake
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
As you know, every birthday party has a cake! This time, Babaei is going to prepare the very special birthday party's cake.
Simple cake is a cylinder of some radius and height. The volume of the simple cake is equal to the volume of corresponding cylinder. Babaei has n simple cakes and he is going to make a special cake placing some cylinders on each other.
However, there are some additional culinary restrictions. The cakes are numbered in such a way that the cake number i can be placed only on the table or on some cake number j where j < i. Moreover, in order to impress friends Ba
最低0.47元/天 解锁文章
134
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
