高效算法-贪心法
lab104_yifan
这个作者很懒,什么都没留下…
展开
-
HDU 1257 最少拦截系统 (贪心)
用个set,set中存的是每套拦截系统的最低高度,然后每次遇到一个新的导弹,找最近的不小于导弹高度的拦截系统去拦截,如果找不到,就加一套系统,用个set维护即可代码:#include #include using namespace std;int n, h;set have;set::iterator it;int main() { while (~scanf("原创 2015-04-14 16:25:20 · 549 阅读 · 0 评论 -
Codeforces Round #241 (Div. 2) C
题目链接:C. Booking System题意:n个旅游团,每个团有一定人数,和开销,现在一个餐馆有k个桌子,每个桌子能坐一定人数,要把这些桌子分配给旅游团,一定要能坐的人数大于旅游团人数才能坐下,问最多能赚的钱,并输出旅游团桌子匹配方案。思路:贪心,从钱最多的旅游团开始放,每次从最小的桌子开始找,然后注意最后输出的id号,所以排序前要多存一个id代码:#include原创 2014-04-14 00:08:42 · 1314 阅读 · 0 评论 -
UVA 12121 - You are around me ...(贪心+几何)
链接:12121 - You are around me ...题意:给定n个人的坐标,椭圆的离心率e,椭圆的角度r。要求这n个人的椭圆面积相等,并且尽量大,但是不能有两两相交,问这个最大面积。思路:贪心,先按x坐标排序算一次,再按y坐标排序算一次,每次椭圆和最近的两个椭圆相比计算出最大合适面积,维护这个面积的最小值即可。代码:#include #include #includ原创 2014-03-27 22:52:12 · 1085 阅读 · 0 评论 -
12222 - Mountain Road(dp+贪心)
Problem EMountain RoadIn the Franconian Switzerland, there is a narrow mountain road. With only a single lane, this is a bottleneck for two-way traffic. Your job is to schedule incoming cars原创 2014-03-15 00:04:10 · 1649 阅读 · 0 评论 -
UVA 1456 - Cellular Network(dp + 贪心)
A cellular network is a radio network made up of a number of cells each served by a base station located in the cell. The base station receives call signals from mobile users (mobiles) in the cell i原创 2014-02-19 08:31:14 · 1091 阅读 · 0 评论 -
UVA 10691 - Subway(贪心+区间选点)
Problem DSubwayInput: standard inputOutput: standard outputTime Limit: 4 secondsThe government in a foreign land is looking into the possibility of establishing a subway system in its capita原创 2014-02-18 17:51:38 · 1176 阅读 · 0 评论 -
1442 - Cav(扫描+推理)
As an owner of a land with a cave you were delighted when you last heard that underground fuel tanks are great business. Of course, the more volume one can store, the better. In case of your cave, the原创 2014-02-10 20:42:10 · 1974 阅读 · 0 评论 -
UVA 221 - Urban Elevations(枚举+区间覆盖)
Urban Elevations An elevation of a collection of buildings is an orthogonal projection of the buildings onto a vertical plane. An external elevation of a city would show the skyline and原创 2014-02-10 08:18:22 · 3542 阅读 · 0 评论 -
1392 - DNA Regions(推理+贪心+二分)
A DNA sequence or genetic sequence is a succession of letters representing the primary structure of a real or hypothetical DNA molecule or strand, with the capacity to carry information. The possible原创 2014-02-05 22:42:09 · 1315 阅读 · 0 评论 -
UVA 1121 - Subsequence((贪心+优先队列)| TwoPointer)
A sequence of N positive integers (10 N , each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence o原创 2014-01-19 18:08:50 · 1560 阅读 · 0 评论 -
UVA 1467 - Installations(贪心)
In the morning, service engineers in a telecom company receive a list of jobs which they must serve today. They install telephones, internet, ipTVs, etc and repair troubles with established facilities原创 2014-01-17 22:50:50 · 1830 阅读 · 3 评论 -
1451 - Average(数形结合)
A DNA sequence consists of four letters, A, C, G, and T. The GC-ratio of a DNA sequence is the number of Cs and Gs of the sequence divided by the length of the sequence. GC-ratio is important in gene原创 2014-01-26 17:40:00 · 1149 阅读 · 0 评论 -
UVA 1316 - Supermarket(贪心+经典问题)
A supermarket has a set Prod of products on sale. It earns a profit px for each product x in Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment原创 2014-01-18 19:23:32 · 1937 阅读 · 0 评论 -
Codeforces Round #241 (Div. 2) D
题目链接:D. Population Size题意:一些数字,要求分块,使得每一块都是等差数列,但是有些数字是-1,代表任意数字(但是要大于0),问最少需要分几块。思路:贪心。每次找到相邻两个确定数字,并且记录下第一个数字前有多少个-1,就能确定出公差,然后利用公差去判断前面的-1能不能填进去,如果不能ans就多1,然后从第二个确定数字位置开始找,如果可以,就利用公差一直找到能放的原创 2014-04-14 00:12:50 · 1345 阅读 · 0 评论 -
UVA 1371 - Period(DP)
题目链接:1371 - Period题意:给定两个字符串,可以把第二个字符串分成若干份,然后由第一个字符串去操作得到每个分出来的字符串,代价为其中的最大值,要求代价的最小值思路:第一个字符串长度为50,所以答案肯定不会超过50,可以二分答案0到50,不二分的话直接就超时了,然后每次判断进行dp操作,类似LCS问题,只不过原来是相同的+1,现在变成不同的+1,因为不同的肯定就要进行操作了,然原创 2014-05-03 23:54:35 · 1445 阅读 · 0 评论 -
UVA 11400 Lighting System Design(贪心+DP)
Problem FLighting System DesignInput: Standard InputOutput: Standard Output You are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation &原创 2014-03-24 22:44:32 · 1415 阅读 · 1 评论 -
POJ 3614 Sunscreen(贪心)
POJ 3614 Sunscreen题目链接题意:转自http://blog.csdn.net/sdj222555/article/details/10698641有C个奶牛去晒太阳 (1 而刚开始的阳光的强度非常大,奶牛都承受不住,然后奶牛就得涂抹防晒霜,防晒霜的作用是让阳光照在身上的阳光强度固定为某个值。那么为了不让奶牛烫伤,又不会没有效果。给出了L种防晒霜。每原创 2014-11-06 23:26:11 · 1141 阅读 · 0 评论 -
HDU 5014 Number Sequence(西安网络赛H题)
HDU 5014 Number Sequence题目链接思路:对于0-n,尽量不让二进制中的1互相消掉就是最优的,那么只要两个数只要互补就可以了,这样每次从最大的数字,可以找到和他互补的数字,然后这个区间就能确定了,然后剩下的递归下去为一个子问题去解决代码:#include #include const int N = 100005;int n, a[N]原创 2014-09-14 21:00:02 · 2005 阅读 · 8 评论 -
UVA 12130 - Summits(BFS+贪心)
UVA 12130 - Summits题目链接题意:给定一个h * w的图,每个位置有一个值,现在要求出这个图上的峰顶有多少个。峰顶是这样定义的,有一个d值,如果一个位置是峰顶,那么它不能走到不大于该峰顶高度 - d的位置,如果满足这个条件下,并且无法走到更高的山峰,那么它就是峰顶思路:利用贪心的策略,把所有点丢到优先队列,每次取出最高的峰值开始找,进行广搜,搜的过程中记录原创 2014-08-14 00:50:20 · 1345 阅读 · 5 评论 -
UVA 538 - Balancing Bank Accounts(贪心)
UVA 538 - Balancing Bank Accounts题目链接题意:给定一些人的欠钱关系,要求在n-1次内还清钱,问方案思路:贪心,处理出每个人最后钱的状态,然后直接每个人都和最后一个人操作即可代码:#include #include #include #include #include using namespace std;co原创 2014-08-28 10:43:02 · 1783 阅读 · 0 评论 -
HDU 4974 A simple water problem(贪心)
HDU 4974 A simple water problem题目链接签到题,很容易贪心得到答案是(sum + 1) / 2和ai最大值的最大值代码:#include #include #include using namespace std;const int N = 100005;typedef long long ll;int t, n;ll原创 2014-08-21 21:46:16 · 1207 阅读 · 0 评论 -
UVA 1511 Soju(贪心)
UVA 1511 Soju题目链接题意:给定两个点集,要求两个点集各取一点曼哈顿距离最小值,保证点集1的x都小于0,点集2的x都大于0.思路:由于x2 > x1所以只要考虑y值,如果一个y比另一个y大,那么就是y1 - y2,否则为y2 - y1,这样一来只要对这两种情况,分别进行两次排序贪心计算即可代码:#include #include #inclu原创 2014-07-27 14:55:05 · 1270 阅读 · 0 评论 -
HDU 4883 TIANKENG’s restaurant(区间选点)
HDU 4883 TIANKENG’s restaurant题目链接题意:给定一些时间作为区间,和一个人数,问要安排多少人去看管(一个人只能看管一个人)思路:普通的区间选点问题,一个区间拆成一个进入点一个出去点,然后排序循环求答案即可代码:#include #include #include using namespace std;const in原创 2014-07-27 23:04:16 · 861 阅读 · 0 评论 -
POJ1518、 UVA1531 - Problem Bee(几何+贪心)
Imagine a perfectly formed honeycomb, spanning the infinite Cartesian plane. It is an interlocking grid composed of congruent equilateral hexagons. One hexagon is located so that its center is at the原创 2014-03-04 12:16:13 · 1674 阅读 · 0 评论 -
HDU 4882 ZCC Loves Codefires(贪心水)
HDU 4882 ZCC Loves Codefires题目链接题意:给定一些任务,每个任务有e,k,e表示完成需要时间,k表示完成后消耗,为完成时间t * k,求一个顺序使得完成消耗最少思路:贪心,知道k大的尽量早晚餐,t小的尽量早完成,所以t / k小的尽量早完成,排个序即可代码:#include #include #include using n原创 2014-07-24 22:43:56 · 1040 阅读 · 0 评论 -
HDU 4864 Task(贪心)
HDU 4864 Task题目链接题意:有一些机器和一些任务,都有时间和等级,机器能做任务的条件为时间等级都大于等于任务,并且一个任务只能被一个机器做,现在求最大能完成任务,并且保证金钱尽量多思路:贪心,对于每个任务,时间大的优先去匹配,时间相同的,等级大的优先去匹配,因为时间占得多,时间多1就多500,而等级最多才差200。然后匹配的时候,尽量使用等级小的去匹配,而时间只原创 2014-07-22 22:51:14 · 973 阅读 · 0 评论 -
UVA 1319 - Maximum(数论+贪心)
题目链接:1319 - Maximum同这篇:原创 2014-04-13 13:01:46 · 1257 阅读 · 0 评论 -
HDU 4803 Poor Warehouse Keeper(贪心)
http://acm.hdu.edu.cn/showproblem.php?pid=4803贪心的策略是,每次尽量加价格,加到能满足原创 2014-05-15 22:06:34 · 1399 阅读 · 0 评论 -
UVA 668 - Parliament(贪心构造)
Parliament New convocation of The Fool Land's Parliament consists of N delegates. According to the present regulation delegates should be divided into disjoint groups of different sizes原创 2014-01-14 00:05:10 · 2398 阅读 · 0 评论 -
UVA 11920 - 0 s, 1 s and ? Marks(贪心)
0 s, 1 s and ? Marks Given a string consisting of 0, 1 and ? only, change all the ? to 0/1, so that the size of the largest group is minimized. A group is a substring that contains eit原创 2014-01-13 13:57:30 · 1121 阅读 · 0 评论 -
UVA 502 - DEL command(贪心构造)
DEL command It is required to find out whether it is possible to delete given files from MS-DOS directory executing the DEL command of MS-DOS operation system only once. There are no nes原创 2014-01-13 10:56:01 · 1108 阅读 · 0 评论 -
UVA 11520 - Fill the Square (贪心)
Problem AFill the SquareInput: Standard InputOutput: Standard Output In this problem, you have to draw a square using uppercase English Alphabets.To be more precise, you will be given a sq原创 2013-12-12 18:52:03 · 1047 阅读 · 0 评论 -
UVA 1335 - Beijing Guards(贪心)
Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in t原创 2013-12-17 20:44:35 · 1312 阅读 · 0 评论 -
UVA 1422 - Processor (二分+贪心+优先队列)
An ``early adopter" Mr. Kim bought one of the latest notebooks which has a speed-controlled processor. The processor is able to operate at variable speed. But the higher the speed, the higher the po原创 2013-12-17 11:45:21 · 1155 阅读 · 0 评论 -
1267 - Network (贪心)
Consider a tree network with n nodes where the internal nodes correspond to servers and the terminal nodes correspond to clients. The nodes are numbered from 1 to n . Among the servers, there is an原创 2013-12-16 20:35:00 · 1356 阅读 · 0 评论 -
UVA 1368 - DNA Consensus String(贪心)
Figure 1.DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, namely Adenine, Thymine, Guanine, and Cytosine as shown in Fi原创 2013-12-16 16:10:11 · 2113 阅读 · 2 评论 -
UVA 11134 - Fabled Rooks(贪心+优先队列)
We would like to place n rooks, 1 ≤ n ≤ 5000, on a n×n board subject to the following restrictionsThe i-th rook can only be placed within the rectangle given by its left-upper corner (xli, yli)原创 2013-12-19 21:19:00 · 1269 阅读 · 0 评论 -
UVA 11729 - Commando War(贪心)
GCommando WarInput: Standard InputOutput: Standard Output “Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was原创 2013-12-06 21:00:59 · 1209 阅读 · 0 评论 -
UVA 11292 The Dragon of Loowater 英文略长略长
UVA 11292 The Dragon of Loowater其实很水的。。。看题目花的时间比写的时间更久。题意是 一个龙有n个头 头都有直径 有m个骑士 骑士有身高 如果身高超过直径 骑士就能砍下龙头 一个骑士只能砍一个头 国王雇佣骑士 价格是骑士的身高 求国王最少要多少钱才能杀掉龙 如果杀不掉 就输出 Loowater is doomed!贪心思想,直接骑士和龙头都从原创 2013-07-18 01:50:01 · 1345 阅读 · 0 评论 -
UVA 12124 UVAlive 3971 Assemble(二分 + 贪心)
Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new原创 2013-08-22 21:30:57 · 1485 阅读 · 0 评论