【杭电-oj】-1070-Milk（结构体）

最新推荐文章于 2020-01-27 20:58:53 发布

Bear1997

最新推荐文章于 2020-01-27 20:58:53 发布

阅读量1.1k

点赞数

分类专栏：结构体

本文链接：https://blog.youkuaiyun.com/Bear1998/article/details/51959191

版权

该博客主要解析了杭电在线判题系统（OJ）中的一道题目——1070-Milk。内容涉及如何解决喝牛奶的问题，即不喝超过6天的牛奶，且每天摄入量不少于200ml。博主通过分析指出，关键是计算每天所需花费，并选择成本最低的方案。

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

Milk

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19112 Accepted Submission(s): 4951

Problem Description

Ignatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know which kind of milk is the cheapest.

Here are some rules:
1. Ignatius will never drink the milk which is produced 6 days ago or earlier. That means if the milk is produced 2005-1-1, Ignatius will never drink this bottle after 2005-1-6(inclusive).
2. Ignatius drin