贪心
MiniSheep_CS
编程者如上帝,可以创造万物。
展开
-
2010acm区域赛(哈尔滨)--Assignments(贪心水题)
Problem Description In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs xi time to finish, and each task of type B needs yj time原创 2014-11-11 10:37:21 · 595 阅读 · 0 评论 -
HDU5461 Largest Point 贪心(2015acm沈阳网络赛)
Largest Point Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1274 Accepted Submission(s): 502 Problem Description Given the seq原创 2015-10-21 09:28:54 · 737 阅读 · 0 评论 -
POJ2586 Y2K Accounting Bug(贪心)
Y2K Accounting Bug Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10975 Accepted: 5520 Description Accounting for Computer Machinists (ACM) has sufferred原创 2015-03-09 20:36:55 · 471 阅读 · 0 评论 -
线段区间覆盖代码
题目: 区间长度8,可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5],求最小的能覆盖全部区间的段数. 自己写的代码: #include #include #include using namespace std; const int maxn = 1000; struct point { int start;原创 2015-03-08 21:58:08 · 344 阅读 · 0 评论 -
POJ1328 Radar Installation(区间覆盖)
Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 57054 Accepted: 12867 Description Assume the coasting is an infinite straight line. Land原创 2015-03-09 15:21:12 · 351 阅读 · 0 评论 -
hdu 1009 FatMouse' Trade(贪心)
Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean. The warehouse has N rooms. The i-th room conta原创 2014-11-01 20:47:49 · 417 阅读 · 0 评论 -
Sticks POJ1011 hdu1455 (深度优先搜索DFS)
Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 122528 Accepted: 28390 Description George took sticks of the same length and cut them randomly until a原创 2014-11-15 21:33:10 · 773 阅读 · 0 评论 -
hdu4310 Hero(贪心)
Hero Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2658 Accepted Submission(s): 1196 Problem Description When playing DotA with go原创 2014-11-15 23:56:43 · 515 阅读 · 0 评论 -
区间覆盖问题(贪心)
1)区间完全覆盖问题 问题描述:给定一个长度为m的区间,再给出n条线段的起点和终点(注意这里是闭区间),求最少使用多少条线段可以将整个区间完全覆盖 样例: 区间长度8,可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5] 解题过程: 1将每一个区间按照左端点递增顺序排列,拍完序后为[1,4],[2,4],[2,6],[3,5转载 2015-03-08 20:09:20 · 513 阅读 · 0 评论 -
hdu1086-最少拦截系统(简单贪心)
最少拦截系统 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19697 Accepted Submission(s): 7816 Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦原创 2014-11-12 10:33:57 · 500 阅读 · 0 评论 -
hdu1789(Doing Homework again 贪心)
Doing Homework again Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7011 Accepted Submission(s): 4164 Problem Description Ignat原创 2014-11-12 19:14:08 · 417 阅读 · 0 评论 -
hdu2124--Repair the Wall(贪心水题)
Repair the Wall Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2158 Accepted Submission(s): 1057 Problem Description Long time ago原创 2014-11-12 11:39:31 · 779 阅读 · 0 评论 -
POJ3497 UVA12124 Assemble(二分 + 贪心)
Assemble Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 3361 Accepted: 1070 Description Recently your team noticed that the computer you use to practice原创 2015-09-21 20:06:12 · 476 阅读 · 0 评论