贪心
文章平均质量分 68
_TCgogogo_
这个作者很懒,什么都没留下…
展开
-
LeetCode 1383 Maximum Performance of a Team (优先队列 贪心 推荐)
You are given two integersnandkand two integer arraysspeedandefficiencyboth of lengthn. There arenengineers numbered from1ton.speed[i]andefficiency[i]represent the speed and efficiency of theithengineer respectively.Chooseat mostkd...原创 2022-05-08 20:22:54 · 381 阅读 · 0 评论 -
LeetCode 452 Minimum Number of Arrows to Burst Balloons (贪心,排序)
There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer arraypointswherepoints[i] = [xstart, xend]denotes a balloon whosehorizontal diameterstretches betweenxstartandxend....原创 2022-05-07 15:53:14 · 205 阅读 · 0 评论 -
LeetCode 1054 Distant Barcodes (排序 贪心)
In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer, and it is guaranteed an answer exists.Example 1:Input: barcodes = [1,1,1,2原创 2022-03-18 16:55:07 · 367 阅读 · 0 评论 -
LeetCode 665 Non-decreasing Array (贪心)
Given an arraynumswithnintegers, your task is to check if it could become non-decreasing by modifyingat most one element.We define an array is non-decreasing ifnums[i] <= nums[i + 1]holds for everyi(0-based) such that (0 <= i <= n - 2)....原创 2022-02-22 21:25:48 · 186 阅读 · 0 评论 -
LeetCode 1775 Equal Sum Arrays With Minimum Number of Operations (贪心 排序 推荐)
You are given two arrays of integersnums1andnums2, possibly of different lengths. The values in the arrays are between1and6, inclusive.In one operation, you can change any integer's value inanyof the arrays toanyvalue between1and6, inclusiv...原创 2022-02-06 13:29:24 · 309 阅读 · 0 评论 -
LeetCode 870 Advantage Shuffle (贪心 推荐)
You are given two integer arraysnums1andnums2both of the same length. Theadvantageofnums1with respect tonums2is the number of indicesifor whichnums1[i] > nums2[i].Returnany permutation ofnums1that maximizes itsadvantagewith respect t...原创 2022-02-02 23:00:24 · 425 阅读 · 0 评论 -
HDU 5695 Gym Class (拓扑排序+优先队列)
HDU 5695 Gym Class (拓扑排序+优先队列)原创 2016-05-22 23:10:32 · 732 阅读 · 0 评论 -
Codeforces 276D Little Girl and Maximum XOR (贪心)
Codeforces 276D Little Girl and Maximum XOR (贪心)原创 2016-07-09 22:48:33 · 1155 阅读 · 0 评论 -
101 Hack 39 B Goodland Electricity locked (线段上的最少点覆盖 贪心)
101 Hack 39 B Goodland Electricity locked (线段上的最少点覆盖 贪心)原创 2016-07-13 17:02:44 · 1203 阅读 · 0 评论 -
LeetCode 316 Remove Duplicate Letters (队列+贪心)
LeetCode 316 Remove Duplicate Letters (队列+贪心)原创 2016-08-23 13:52:49 · 1310 阅读 · 2 评论 -
真分数转埃及分数的和 (贪心)
真分数转埃及分数的和 (贪心)原创 2016-09-08 22:15:31 · 1502 阅读 · 0 评论 -
Codeforces 798C Mike and gcd problem (贪心)
Codeforces 798C Mike and gcd problem (贪心)原创 2017-08-03 08:51:33 · 740 阅读 · 0 评论 -
LeetCode 646 Maximum Length of Pair Chain (贪心)
LeetCode 646 Maximum Length of Pair Chain (贪心)原创 2017-12-26 13:52:50 · 603 阅读 · 0 评论 -
LeetCode 435 Non-overlapping Intervals (贪心)
Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note:You may assume the interval's end point is always bigger...原创 2018-03-16 09:34:14 · 462 阅读 · 0 评论 -
LeetCode 621 Task Scheduler (贪心 思维 推荐)
Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks could be done without original order. Each task could ...原创 2019-03-26 01:37:11 · 229 阅读 · 0 评论 -
2019 ICPC World Finals A Azulejos (贪心 排序)
AzulejosAzulejo in the cathedral of Porto. Source:Wikimedia CommonsCeramic artists Maria and João are opening a smallazulejostore in Porto.Azulejosare the beautiful ceramic tiles for which Po...原创 2019-04-05 11:27:59 · 2262 阅读 · 0 评论 -
codeforces 672C Recycling Bottles (枚举+贪心)
codeforces 672C Recycling Bottles (枚举+贪心)原创 2016-05-13 09:55:44 · 1532 阅读 · 0 评论 -
[Offer收割]编程练习赛1 hihocoder 1271 舰队游戏 (状态压缩+贪心 好题)
[Offer收割]编程练习赛1 hihocoder 1271 舰队游戏 (状态压缩+贪心 好题)原创 2016-03-08 11:14:39 · 1141 阅读 · 0 评论 -
HDU 1051 wooden sticks
Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11619 Accepted Submission(s): 4800Problem DescriptionThere is a原创 2014-08-03 15:52:11 · 1148 阅读 · 0 评论 -
HDU 4864 Task
TaskTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3273 Accepted Submission(s): 852Problem DescriptionToday the company has原创 2014-08-15 10:55:57 · 1012 阅读 · 1 评论 -
NOJ 1447 大作业
大作业 时间限制(普通/Java):1000MS/3000MS 运行内存限制:65536KByte 总提交:79 测试通过:29原创 2015-02-02 15:25:43 · 4645 阅读 · 0 评论 -
codeforces 508B Anton and currency you all know
B. Anton and currency you all knowtime limit per test0.5 secondsmemory limit per test256 megabytesBerland, 2016. The exchange rate of currency you all know against the burle has原创 2015-02-05 12:26:33 · 1334 阅读 · 0 评论 -
codeforces 494A Treasure
A. Treasuretime limit per test2 secondsmemory limit per test256 megabytesMalek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string原创 2015-02-06 12:59:28 · 1179 阅读 · 0 评论 -
POJ 1328 Radar Installation (贪心)
Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 56493 Accepted: 12756DescriptionAssume the coasting is an infinite straight line. Land原创 2015-02-07 23:14:11 · 817 阅读 · 0 评论 -
POJ 1018 Communication System (枚举+贪心)
Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23958 Accepted: 8540DescriptionWe have received an order from Pizoor Communication原创 2015-02-18 12:49:46 · 1039 阅读 · 0 评论 -
HDU 5176 The Experience of Love (带权并查集 + 贪心)
HDU 5176 The Experience of Love (带权并查集 + 贪心)原创 2015-02-18 13:11:58 · 1744 阅读 · 0 评论 -
POJ 3253 Fence Repair (优先权队列+贪心)
POJ 3253 Fence Repair (优先权队列+贪心)原创 2015-04-03 16:05:48 · 913 阅读 · 0 评论 -
HDU 5285 wyh2000 and pupil (DFS染色判二分图 + 贪心)
HDU 5285 wyh2000 and pupil (DFS染色判二分图 + 贪心)原创 2015-07-26 11:32:44 · 1301 阅读 · 0 评论 -
POJ 3069 Saruman's Army (简单贪心)
POJ 3069 Saruman's Army (简单贪心)原创 2015-07-13 22:54:08 · 1352 阅读 · 0 评论 -
codeforces 500C New Year Book Reading (贪心,很好的思维题)
codeforces跨年赛c题的详细解释,贪心原创 2015-02-07 20:49:43 · 2585 阅读 · 0 评论 -
HDU 5303 Delicious Apples (贪心 枚举 好题)
HDU 5303 Delicious Apples (贪心 枚举 好题)原创 2015-07-23 23:50:33 · 2609 阅读 · 0 评论 -
HDU 5527 Too Rich (好题 贪心 DFS)
HDU 5527 Too Rich (贪心 DFS)原创 2015-11-04 11:36:49 · 2341 阅读 · 1 评论 -
ZOJ 3908 Number Game (贪心+二分+multiset)
ZOJ 3908 Number Game原创 2015-10-11 19:45:55 · 1130 阅读 · 1 评论 -
CodeForces 449A Jzzhu and Chocolate
A. Jzzhu and Chocolatetime limit per test1 secondmemory limit per test256 megabytesJzzhu has a big rectangular chocolate bar that consists of n × m unit squares. He wants to cut原创 2014-08-13 00:44:17 · 1199 阅读 · 0 评论