贪心
文章平均质量分 76
还是太年轻
这个作者很懒,什么都没留下…
展开
-
POJ 3040 Allowance(贪心经典题目)
Source Code#include#include#includeusing namespace std;struct node{ int x, y;}cow[21];bool cmp(node a, node b){ return a.x b.x;}int main(){ int N, C; while (cin >> N >> C) { int s原创 2017-12-08 13:43:17 · 485 阅读 · 0 评论 -
POJ 1862 Stripies
StripiesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions:18910 Accepted: 8457DescriptionOur chemical biologists have invented a new very useful form of原创 2018-02-03 21:26:13 · 523 阅读 · 0 评论 -
HDU 1789 Doing Homework again
Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15751 Accepted Submission(s): 9190Problem DescriptionIgnatius has just co原创 2018-01-19 15:46:28 · 148 阅读 · 0 评论 -
POJ 3614 Sunscreen(贪心)
SunscreenTime Limit: 1000MS Memory Limit: 65536KTotal Submissions:9946 Accepted: 3465DescriptionTo avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2原创 2018-02-04 10:48:37 · 169 阅读 · 0 评论 -
POJ 2010 Moo University - Financial Aid
Moo University - Financial AidTime Limit: 1000MS Memory Limit: 30000KTotal Submissions:10699 Accepted: 3146DescriptionBessie noted that although humans have man原创 2018-02-04 11:45:37 · 164 阅读 · 0 评论 -
HDU 1051 Wooden Sticks(贪心)
Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23538 Accepted Submission(s): 9557Problem DescriptionThere is a原创 2018-01-28 13:04:12 · 163 阅读 · 0 评论 -
POJ 3045 Cow Acrobats
Cow AcrobatsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions:6087 Accepted: 2283DescriptionFarmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the c...原创 2018-02-11 09:58:40 · 144 阅读 · 0 评论 -
纪念品分组-NOIP2007PJT2
问题 F: 纪念品分组-NOIP2007PJT2时间限制: 1 Sec 内存限制: 128 MB提交: 55 解决: 28[提交][状态][讨论版]题目描述纪念品分组(group.pas/c/cpp)题目描述元旦快到了,校学生会让乐乐负责新年晚会的纪念品发放工作。为使得参加晚会的同学所获得 的纪念品价值相对均衡,他要把购来的纪念品根据价格进行分组,但每组最多只能包括两件纪念品, 并且每组纪念品...原创 2018-03-17 15:29:16 · 657 阅读 · 0 评论 -
ZOJ 4019 Schrödinger's Knapsack(dp+贪心)
Schrödinger's KnapsackTime Limit: 1 Second Memory Limit: 65536 KBDreamGrid has a magical knapsack with a size capacity of called the Schrödinger's knapsack (or S-knapsack for short) and two type...原创 2018-04-08 09:54:26 · 484 阅读 · 0 评论 -
Wannafly挑战赛13 D-applese的生日(贪心)
链接:https://www.nowcoder.com/acm/contest/80/D来源:牛客网题目描述 最可爱的applese生日啦,他准备了许多个质量不同的蛋糕,想请一些同学来参加他的派对为他庆生,为了不让一部分同学感到不爽,他决定把每个蛋糕都分割成几份(也可以不分割),使得最小的蛋糕的质量与最大的蛋糕的质量的比值不小于一个值。但是applese的刀功并不是很好,所以他希望切尽量少的...原创 2018-04-08 10:13:44 · 280 阅读 · 0 评论 -
西安电子科技大学第16届程序设计竞赛网络同步赛 F-Operating System(贪心)
链接:https://www.nowcoder.com/acm/contest/107/F来源:牛客网题目描述在学习Operating System的过程中,Glory遇到了这样一个问题,现在有一个大小为可以容纳N个页面的内存,硬盘内的内容被分成M个页面,用1~M来标识,一开始内存里没有任何页面,接下来用户会请求Q个页面,你需要设计一个置换算法,使得缺页发生的次数最少。缺页是指原创 2018-04-22 09:54:42 · 763 阅读 · 1 评论 -
Codeforces Round #477 (rated, Div. 2, based on VK Cup 2018 Round 3) D. Resource Distribution
D. Resource Distributiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne department of some software company has nn servers of different specif...原创 2018-05-04 15:16:59 · 205 阅读 · 0 评论 -
Wannafly挑战赛15 A-最小化价格(贪心)
链接:https://www.nowcoder.com/acm/contest/112/A来源:牛客网题目描述现有n组人,m个地点,给出每组人的人数,每个地点可容纳的最大人数和选择的价格 要求一种方式,使得每组人都到一个各不相同的地点,最小化选择的价格 每个队伍的人都要在同一个地方每个地方只能有一个队伍输入描述:第一行n,m第二行n个数,表示每组的人数接下来m行,每行两个数,表示可容纳...原创 2018-05-12 10:52:23 · 251 阅读 · 0 评论 -
POJ 3262 Protecting the Flowers
Protecting the FlowersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions:8486 Accepted: 3421DescriptionFarmer John went to cut some wood and left N (2 ≤ N原创 2018-02-03 20:59:25 · 110 阅读 · 0 评论 -
POJ 3190 Stall Reservations
Stall ReservationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions:8581 Accepted:2981 Special JudgeDescriptionOh those picky N (1 <= N <= 50,000) co原创 2018-02-03 19:22:49 · 131 阅读 · 0 评论 -
HDU 2850 Load Balancing (贪心+优先队列)
Load BalancingTime Limit: 2000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1129 Accepted Submission(s): 449Special JudgeProblem DescriptionIn the Wide Web原创 2018-01-19 14:57:39 · 228 阅读 · 0 评论 -
贪心算法-看节目
Select Code#includeusing namespace std;int main(){ int n; while (cin >> n&&n) { int a[101][3]; for (int i = 1; i <= n; i++) { cin >> a[i][1]; cin >> a[i][2]; } for (int i = 1;原创 2017-11-11 16:56:49 · 895 阅读 · 0 评论 -
POJ 3617 Best Cow Line
Source Code#includeusing namespace std;int main(){ int n; while (cin >> n) { char a[2005]; for (int i = 0; i n; i++) cin >> a[i]; int st = 0, back = n - 1; int t = 0; while (st ba原创 2017-12-05 16:16:39 · 127 阅读 · 0 评论 -
POJ 3069 Saruman's Army
Source Code#include#include#includeusing namespace std;int main(){ int k, n; while (cin >> k >> n && (k + n) != -2) { int a[1003]; int j = 0; for (int i = 0; i n; i++) { cin >> a[i原创 2017-12-05 17:57:15 · 109 阅读 · 0 评论 -
POJ 3253 Fence Repair
#include#includeusing namespace std;int main(){int n;while (cin >> n){int a[20002];for (int i = 0; i cin >> a[i];if (n == 1){cout }sort(a, a + n);long long sum = 0;wh原创 2017-12-05 19:44:24 · 110 阅读 · 0 评论 -
POJ 2376 Cleaning Shifts
Source Code#include#includeusing namespace std;struct node{ int x, y;}cow[25002];bool cmp(node a, node b){ return a.x b.x;}int main(){ int n, k; while (cin >> n >> k) { bool xx = 0原创 2017-12-06 14:19:49 · 99 阅读 · 0 评论 -
POJ 1328 Radar Installation
Source Code#include#include#includeusing namespace std;int main(){ int n, k, nn = 1; while (cin >> n >> k && (n + k)) { double a[1002][2]; bool b = 1; for (int i = 0; i n; i++) { i原创 2017-12-06 21:35:49 · 108 阅读 · 0 评论 -
POJ 2393 Yogurt factory
Source Code#include#include#include#includeusing namespace std;int main(){ long long N, S; while (cin >> N >> S) { long long a[10002], b[10002]; for (int i = 1; i N; i++) cin >> a[i原创 2017-12-08 10:43:18 · 146 阅读 · 0 评论 -
POJ 1017 Packets
Source Code#includeusing namespace std;int main(){ int x1, x2, x3, x4, x5, x6; while (cin >> x1 >> x2 >> x3 >> x4 >> x5 >> x6 && (x1 + x2 + x3 + x4 + x5 + x6)) { long long sum = x6 + x5 + x4原创 2017-12-08 10:45:44 · 167 阅读 · 0 评论 -
POJ 2431Expedition(贪心+优先队列)
ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions:19288 Accepted: 5554DescriptionA group of cows grabbed a truck and ventured on an expedition de原创 2018-01-04 14:52:19 · 213 阅读 · 0 评论 -
HDU 1009 FatMouse' Trade
FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 85708 Accepted Submission(s): 29732Problem DescriptionFatMouse原创 2018-01-12 20:33:22 · 119 阅读 · 0 评论 -
HDU 2037 今年暑假不AC(贪心策略)
今年暑假不ACTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 66503 Accepted Submission(s): 35746Problem Description“今年暑假不AC?”“是的。”“那你干什么呢?”“看世界杯呀,笨原创 2018-01-19 11:01:52 · 118 阅读 · 0 评论 -
HDU 1050 Moving Tables
Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38829 Accepted Submission(s): 12791Problem DescriptionThe famous ACM (Advanced C原创 2018-01-19 12:10:46 · 119 阅读 · 0 评论 -
CodeForce 981 D. Bookshelves(贪心+dp)
D. Bookshelvestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr Keks is a typical white-collar in Byteland.He has a bookshelf in his office with s...原创 2018-06-17 14:32:28 · 285 阅读 · 0 评论