贪心
small__snail__5
如果有一天您来到了这里请留下您的痕迹,欢迎各种评论,一同进步。
我愿意做一只小蜗牛,不艳羡别人的速度,而独享自己的慢慢旅程,总有一天,我也可以骄傲的告诉所有人,我虽然慢,但是我不曾放弃,人生总要坚持点什么。
展开
-
hdu1009(贪心)
/*贪心策略按照性价比排序,买的话每一次只买性价比最高的*/#include #include #include #include #include using namespace std;struct node{ int pean, cat; double core;//性价比 bool operator < (const node a) const{原创 2017-04-29 14:35:32 · 342 阅读 · 0 评论 -
hdu1789
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after th原创 2017-05-02 12:17:05 · 358 阅读 · 0 评论 -
hdu4310
When playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN.There are two key attribute原创 2017-05-02 15:56:17 · 383 阅读 · 0 评论 -
hdu4864(贪心)
Today the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below this task’s level yi cannot complete原创 2017-05-03 10:22:25 · 727 阅读 · 0 评论 -
poj1456(贪心)
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 s原创 2017-05-03 11:35:08 · 429 阅读 · 0 评论 -
poj2393(贪心)
The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the co原创 2017-05-03 15:25:42 · 474 阅读 · 0 评论 -
uva1149(贪心)
A set of n 1-dimensional items have to be packed in identical bins. All bins have exactly the same length l and each item i has length li<=l . We look for a minimal number of bins q such thateac原创 2017-05-03 19:46:36 · 498 阅读 · 0 评论 -
poj2586 Y2K Accounting Bug
//题意:给定一个s,d分别代表盈利的值和亏损的值,然后一年12个月要保证连续的5个月必须亏损,问一年能否盈利能的话求出最大盈利值,否则输出Deficit;//思路:可以分类讨论s>=4d时必定全年都要亏损否则不满足题意;4d>s>=3d,3d>s>=2d,2d>s>d在推2s和d的关系,3s和d的关系,4s和d的关系,此时再将同类的合并便可求出想要的答案...原创 2018-04-15 17:25:42 · 209 阅读 · 0 评论 -
poj1700 crossing river(贪心)
//题意:很好的一道贪心,给一个t代表多组输入,n代表n个人,n个数字代表每个人划到对岸的时间。题目给你一条船,船最多每次载2人也可以一个人,两个人时划船速度为慢的那个人的速度,每次划过到对面后需要一个人在把船划回来接没有过去的人,知道所有人都过去,当然往返都要计时。//思路:首先想到的是给所有时间排序,每次用划船时间最少的人往返这只是思路之一,这时要考虑的是,如样例所给1 2 5 10;若按照之...原创 2018-05-25 10:54:52 · 355 阅读 · 0 评论