nyoj 208 + poj 1456 Supermarket (贪心)

Supermarket

时间限制:1000 ms  |  内存限制:65535 KB

难度:4

描述

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∈Sellpx. An optimal selling schedule is a schedule with a maximum profit.

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.

Write a program that reads sets of products from an input text file and computes the profit of an optimal selling schedule for each set of products.

输入
A set of products starts with an integer 0 <= n <= 10000, which is the number of products in the set, and continues with n pairs pi di of integers, 1 <= pi <= 10000 and 1 <= di <= 10000, that designate the profit and the selling deadline of the i-th product. White spaces can occur freely in input. Input data terminate with an end of file and are guaranteed correct.
输出
For each set of products, the program prints on the standard output the profit of an optimal selling schedule for the set. Each result is printed from the beginning of a separate line.
样例输入
4  50 2  10 1   20 2   30 1

7  20 1   2 1   10 3  100 2   8 2
   5 20  50 10
样例输出
80
185
 1 /**
 2     题目大意:
 3         求:能够得到的最大利润
 4         数据说明:
 5             n ==> 表示有n种商品
 6             px dx ==> 只要商品在dx (包括dx)之前买完就可以获得px的利润
 7             一天只可以买一种商品
 8
 9     步骤(贪心):
10         ①、将px降序排列
11         ②、每件商品从最大期限的时间的开始查找直到找到可以使用的时间 (或者到第一天)
12             ②(1)如果是找到满足条件的时间就将该件商品的px加入能够得到的总利润中(然后跳出循环)
13             ②(2)如果是找不到就不将该商品的px加入到总利润中
14 **/

核心代码:

 1 sort (P, P+n, cmp);
 2
 3 for (int i = 0; i < n; ++ i)
 4 {
 5     for (int j = P[i].dx; j >= 1; -- j)
 6     {
 7         if (!book [i])
 8         {
 9             book [i] = 1;
10             cnt += P[i].px;
11             break;
12         }
13     }
14 }

C/C++代码实现(AC):

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<cmath>
 4 #include<algorithm>
 5 #include<iostream>
 6
 7 using namespace std;
 8
 9 int n, cnt, flag[100*105];
10
11 struct node
12 {
13     int v, k;
14 }P[100*105];
15
16 bool cmp(node a, node b)
17 {
18     return a.v > b.v;
19 }
20
21 int main(){
22     while(~scanf("%d", &n))
23     {
24         cnt = 0;
25         memset(flag, 0, sizeof(flag));
26         for(int i = 0; i < n; ++ i)
27             scanf("%d%d", &P[i].v, &P[i].k);
28         sort(P, P + n, cmp);
29         for(int i = 0; i < n; ++ i)
30         {
31             for(int j = P[i].k; j >= 1; -- j)
32             {
33                 if (!flag[j])
34                 {
35                     flag[j] = 1;
36                     cnt += P[i].v;
37                     break;
38                 }
39             }
40         }
41         printf("%d\n", cnt);
42     }
43     return 0;
44 }

原文地址:https://www.cnblogs.com/GetcharZp/p/8993303.html

时间: 2024-10-13 09:53:46

nyoj 208 + poj 1456 Supermarket (贪心)的相关文章

poj 1456 Supermarket (贪心+并查集)

# include <stdio.h> # include <algorithm> # include <string.h> using namespace std; int fa[10010]; struct node { int p; int d; }; struct node a[10010]; bool cmp(node a1,node a2)//利润从大到小 { return a1.p>a2.p; } int find(int x) { if(fa[x]

POJ 1456 Supermarket 区间问题并查集||贪心

F - Supermarket Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1456 Appoint description:  System Crawler  (2015-11-30) Description A supermarket has a set Prod of products on sale. It earns a p

POJ 1456——Supermarket——————【贪心+并查集优化】

Supermarket Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1456 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

poj 1456 Supermarket - 并查集 - 贪心

题目传送门 传送点I 传送点II 题目大意 有$n$个商品可以销售.每个商品销售会获得一个利润,但也有一个时间限制.每个商品需要1天的时间销售,一天也只能销售一件商品.问最大获利. 考虑将出售每个物品尽量外后安排.这样当一个商品不能安排的时候看能不能替换掉它能够出售的时间中盈利最小的商品. 因此可以将物品排序,这样只用考虑能否让每个物品出售. 为了找到第一个空闲时间,又因为已经安排的时间不会改变,所以用并查集将已经安排了出售的时间段缩起来. Code 1 /** 2 * poj 3 * Prob

POJ 1456 Supermarket(贪心+并查集)

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 precise

贪心/poj 1456 Supermarket

1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 using namespace std; 5 struct node 6 { 7 int value; 8 int ddl; 9 }; 10 node a[10010]; 11 bool day[10010]; 12 int n,ans; 13 bool cmp(node x,node y) 14 { 15 return x.value>y

poj 1456 Supermarket(并查集维护区间)

 题意:有一些货物,每个货物有价值和卖出的截至日期,每天可以卖一个货物,问能卖出的最大价值是多少. 思路:算法不难想到,按价值降序排列,对于每一件货物,从deadline那天开始考虑,如果哪天空闲那么将货物在该天卖出. 如果直接暴力来做,复杂度为o(n*n),显然不行.可以用并查集来维护当前ddl之前空闲的最近的一天,如果父节点为0说明deadline之前没有空闲的时间,那么该货物就无法卖出. #include<cstdio> #include<cstring> #includ

poj 1456 supermarket

题目大意: 有很多物品要卖,每种物品都有自己的价值和截止日期,每个物品都必须在截止日期前卖出去,求最后获得的最大价值和是多少 思路: 优先队列 按照截止日期由大到小排序,从最大截止日期开始,一天天向前推直到1 如果某天是一个东西的截止日期,就把这件东西的价值加到优先队列里,每天都从优先队列里卖一个东西,ans+=q.top(),然后pop 最后输出ans #include<iostream> #include<cstdio> #include<cmath> #inclu

POJ 1862 Stripies 贪心+优先队列

http://poj.org/problem?id=1862 题目大意: 有一种生物能两两合并,合并之前的重量分别为m1和m2,合并之后变为2*sqrt(m1*m2),现在给定n个这样的生物,求合并成一个的最小重量 思路: m1+m2 >=  2*sqrt(m1*m2) 所以每次取大的去合并,能变小. 直接优先队列就可以啦. #include<cstdio> #include<cmath> #include<queue> using namespace std;