HDU4811 Ball 2013ACM/ICPC亚洲区南京站现场赛 (模拟乱搞)

最新推荐文章于 2019-04-08 17:14:27 发布

MrBlankIsAwesome

最新推荐文章于 2019-04-08 17:14:27 发布

阅读量1k

点赞数

分类专栏：模拟

本文链接：https://blog.youkuaiyun.com/mrlry/article/details/53411520

版权

Jenny有红、黄、蓝三种颜色的球，他需要将这些球按顺序排列在桌子上，每次放置可以获得不同数量的分数。目标是找出最大总分。输入包含若干测试用例，每个用例给出每种颜色球的数量。输出每个用例的最大得分。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Ball

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2344 Accepted Submission(s): 983

Problem Description
Jenny likes balls. He has some balls and he wants to arrange them in a row on the table.
Each of those balls can be one of three possible colors: red, yellow, or blue. More precisely, Jenny has R red balls, Y yellow balls and B blue balls. He may put these balls in any order on the table, one after another. Each time Jenny places a new ball on the table, he may insert it somewhere in the middle (or at one end) of the already-placed row of balls.
Additionally, each time Jenny places a ball on the table, he scores some points (possibly zero). The number of points is calculated as follows:
1.For the first ball being placed on the table, he scores 0 point.
2.If he places the ball at one end of the row, the number of points he scores equals to the number of different colors

最低0.47元/天解锁文章