贪心
HonniLin
double fighting
展开
-
cf-381A-Sereja and Dima
题目:Sereja and Dima play a game. The rules of the game are very simple. The players have n cards in a row. Each card contains a number, all numbers on the cards are distinct. The players take t原创 2014-01-24 11:10:28 · 899 阅读 · 0 评论 -
POJ 3040 - Allowance(贪心)
DescriptionAs a reward for record milk production, Farmer John has decided to start paying Bessie the cow a small weekly allowance. FJ has a set of coins in N (1 <= N <= 20) different denominations,原创 2015-02-17 11:33:54 · 1268 阅读 · 0 评论 -
POJ 1862 - Stripies(贪心)
DescriptionOur chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English原创 2015-02-17 11:04:38 · 602 阅读 · 0 评论 -
POJ 1017 - Packets(贪心+模拟)
DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always delivered to customers in the square par原创 2015-02-17 11:17:36 · 624 阅读 · 0 评论 -
POJ 3069 - Saruman's Army(贪心)
DescriptionSaruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the tr原创 2015-02-10 08:52:32 · 608 阅读 · 0 评论 -
POJ 2393 - Yogurt factory(贪心)
DescriptionThe 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 wil原创 2015-02-10 20:07:05 · 759 阅读 · 0 评论 -
POJ 3262 - Protecting the Flowers(贪心)
DescriptionFarmer John went to cut some wood and left N (2 ≤ N ≤ 100,000) cows eating the grass, as usual. When he returned, he found to his horror that the cluster of cows was in his garden eatin原创 2015-02-11 14:04:01 · 544 阅读 · 0 评论 -
POJ 2376 - Cleaning Shifts(贪心)
题目:题意:每一只牛工作一定的时间段,要原创 2014-07-14 21:12:21 · 782 阅读 · 0 评论 -
POJ 3045 - Cow Acrobats(贪心)
题目:http://poj.org/problem?id=3045思路:贪心.CODE:#include #include #include #include using namespace std;struct node { int w, s; bool operator < (const node& x) const { retu原创 2015-03-04 14:27:38 · 629 阅读 · 0 评论 -
Codeforces Round #296 (Div. 2) - D. Clique Problem(贪心)
题目:http://codeforces.com/contest/527/problem/D题意:给出n(1 ≤ n ≤ 200 000)个数的坐标和点值(0 ≤ xi ≤ 109, 1 ≤ wi ≤ 109), 求得最大集合使得里面任意两个数|xi - xj| ≥ wi + wj.思路:贪心. (Study from somebody)先将x排序, 设xj 若原创 2015-03-26 17:11:46 · 684 阅读 · 0 评论 -
Codeforces Round #298 (Div. 2) D. Handshakes(贪心)
题目:http://codeforces.com/contest/534/problem/D好水的D题=.= vecotr大法,加递推.AC.#include #include #include using namespace std;const int maxn = 2e5+5;vector v[maxn];int ans[maxn];int main()原创 2015-04-14 16:48:26 · 476 阅读 · 0 评论 -
POJ 3190 - Stall Reservations(贪心)
DescriptionOh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A原创 2015-02-17 11:27:08 · 577 阅读 · 0 评论 -
POJ 3253 - Fence Repair(贪心+Huffman)
DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN (1 ≤ N ≤ 20,000) planks of wood, each having some integer le原创 2015-02-10 10:29:09 · 585 阅读 · 0 评论 -
397A-On Segment's Own Points
time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOur old friend Alexey has finally entered the University of City原创 2014-02-27 17:08:28 · 832 阅读 · 0 评论 -
POJ 1065-Wooden Sticks(贪心+暴力)
Wooden SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18219 Accepted: 7622DescriptionThere is a pile of n wooden sticks. The length and weight of e原创 2014-07-26 00:21:58 · 649 阅读 · 0 评论 -
POJ-1328 Radar Installation
题目:题意:原创 2014-07-15 11:01:13 · 474 阅读 · 0 评论 -
#273.2 C. Table Decorations(贪心)
You have r red, g green and b blue balloons. To decorate a single table for the banquet you need exactly three balloons. Three balloons attached to some table shouldn't have the same color. What max原创 2014-11-05 17:21:56 · 643 阅读 · 0 评论 -
HDU 4442 - Physical Examination(贪心)
Problem DescriptionWANGPENG is a freshman. He is requested to have a physical examination when entering the university.Now WANGPENG arrives at the hospital. Er….. There are so many students, and t原创 2014-12-01 21:41:11 · 714 阅读 · 0 评论 -
LightOJ 1189 - Sum of Factorials(贪心)
DescriptionGiven an integer n, you have to find whether it can be expressed as summation of factorials. For givenn, you have to report a solution such thatn = x1! + x2! + ... + xn! (xi j for a原创 2015-01-27 08:02:20 · 1200 阅读 · 0 评论 -
POJ 3617 - Best Cow Line(贪心)
题目:FJ is about totake his N (1 ≤ N ≤ 2,000)cows to the annual"Farmer of the Year" competition. In this contestevery farmer arranges his cows in a line and herds them past the judges.The contestorg原创 2014-01-24 08:34:01 · 706 阅读 · 0 评论 -
Codeforces Round #280 (Div. 2) C. Vanya and Exams
Vanya wants to pass n exams and get the academic scholarship. He will get the scholarship if the average grade mark for all the exams is at leastavg. The exam grade cannot exceed r. Vanya has pass原创 2015-01-11 23:01:41 · 748 阅读 · 0 评论 -
Codeforces Round #282 (Div. 1) A. Treasure
Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a strings written on the door consisting of characters '(', ')' and '#'. Below there wa原创 2015-01-14 23:09:51 · 557 阅读 · 0 评论 -
Codeforces Round #288 (Div. 2) C. Anya and Ghosts(贪心)
Anya loves to watch horror movies. In the best traditions of horror, she will be visited bym ghosts tonight. Anya has lots of candles prepared for the visits, each candle can produce light for exact原创 2015-02-05 22:26:04 · 530 阅读 · 0 评论 -
HDU 5335 - Walk Out (DFS + 贪心)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=5335题意:n*m的01矩阵,起点(1,1),终点(n,m)。求出走出的路径得到的最小的二进制。思路:贪心策略:一开始能走0就走0,dfs走到离终点最近的0。接下来的路径应该尽可能短,且0尽可能多。本题有一个很巧妙的地方:遍历到离终点最近的0(x+y = tot),接下来的最原创 2015-07-31 15:34:02 · 535 阅读 · 0 评论