Description

A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes precisely one unit of time for being sold. A selling schedule is an ordered subset of products Sell ≤ Prod such that the selling of each product x∈Sell, according to the ordering of Sell, completes before the deadline dx or just when dx expires. The profit of the selling schedule is Profit(Sell)=Σ

_x∈Sell

px. An optimal selling schedule is a schedule with a maximum profit.\\n

For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.\\n

状态	递交者	时间	内存	语言	代码	递交时间
AC	lmjsjg	63ms	1 MiB	C++11	809 Bytes	2023-7-2 17:04:51
AC	whp	94ms	1 MiB	C++98	774 Bytes	2023-3-27 20:09:44

统计

递交统计

Supermarket

信息

状态

开发

支持

还没有账户？

登录