贪心算法New Year BonusGrant

最新推荐文章于 2019-04-08 11:05:17 发布

hqf1992

最新推荐文章于 2019-04-08 11:05:17 发布

阅读量512

点赞数

分类专栏：贪心算法文章标签： c++ 贪心算法

本文链接：https://blog.csdn.net/hqf1992/article/details/47669933

版权

本文介绍了一个关于Mocrosoft公司新年奖金分配的问题，要求根据贪心算法找出分配奖金的最大金额和接收者。每个程序员要么从上级获得奖金，要么分配给下属，但不能同时进行。解决方案是从拓扑排序后的员工列表中，从底部向上选择未被选中且无子节点被选中的员工来分配奖金。

摘要由CSDN通过智能技术生成

New Year BonusGrant

All programmers of Mocrosoft softwarecompany are organized in a strict subordination hierarchy. Every programmer hasexactly one chief, except Bill Hates who is also the head of the company andhas no chief.

Due to the celebration of the new 2003year, chief accountant of Mocrosoft decided to pay a New Year Bonus Grant of1000 dollars to some programmers. However being extremely concerned of the companywealth she would like to designate the least possible amount of money for thesegrants. On the other hand she didn��t want to be accused of being too greedy or of givingpreferences to some programmers. To do this, she developed the following schemeof grants appointment:

Each programmer may either assign a grant to one of his subordinates or have a grant assigned to him by his chief or none of the above.
No programmer can simultaneously receive a grant and assign a grant to one of his subordinates.
No programmer can assign a grant to more than one of his subordinates.

The scheme seemed to be designed perfectly- nobody would like to assign a grant to anybody since in this case he himselfwould not receive money. But programmers somehow discovered the plan of chiefaccountant and decided to make a trick to get the most money possible and sharethem fairly afterwards. The idea was to make such grant assignments that thetotal amount of grant