贪心
文章平均质量分 87
1A_coder
Just for fun!
展开
-
Problem - 363C - Codeforces --C. Fixing Typos
Problem - 363C - Codeforces http://codeforces.com/problemset/problem/363/C C. Fixing Typostime limit per test1 secondmemory limit per test256 megabytesinputstandard inputou转载 2013-11-13 17:53:46 · 1318 阅读 · 0 评论 -
hdu 3697 Selecting courses (暴力+贪心)
Selecting coursesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 62768/32768 K (Java/Others)Total Submission(s): 1856 Accepted Submission(s): 469Problem Description A new原创 2014-10-12 12:05:24 · 1167 阅读 · 0 评论 -
hdu 5014 Number Sequence (贪心)
Number SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 697 Accepted Submission(s): 332Special JudgeProblem Description原创 2014-09-16 18:45:10 · 885 阅读 · 0 评论 -
hdu 5037 Frog (贪心)
FrogTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 789 Accepted Submission(s): 198Problem DescriptionOnce upon a time, the原创 2014-09-22 20:41:19 · 1337 阅读 · 0 评论 -
poj 1328 Radar Installation (贪心)
Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 52823 Accepted: 11883DescriptionAssume the coasting is an infinite straight line. La原创 2014-08-25 20:06:28 · 475 阅读 · 0 评论 -
poj 1089 Intervals
poj 1089 Intervals贪心DescriptionThere is given the series of n closed intervals [ai; bi], where i=1,2,...,n. The sum of those intervals may be represented as a sum of closed pairwise non−intersecting intervals. The task is to find such representation wit原创 2013-12-10 20:40:34 · 1322 阅读 · 0 评论 -
hdu 1052 Tian Ji -- The Horse Racing
Tian Ji -- The Horse Racing 题意:田忌赛马的问题,按照马的速度比较胜负,每胜一场得200分;求田忌比赛的最大值。input392 83 7195 92 74392 83 7092 91 60output0200策略:1、田忌最快的马比王最快的马快,则直接比,赢一场。2、田忌原创 2014-07-29 11:05:11 · 624 阅读 · 0 评论 -
poj 1700 Crossing River
Crossing RiverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10218 Accepted: 3859DescriptionA group of N people wishes to go across a river with only原创 2014-05-09 11:15:57 · 784 阅读 · 0 评论 -
NYOJ 12 喷水装置(二)
喷水装置(二)时间限制:3000 ms | 内存限制:65535 KB难度:4描述有一块草坪,横向长w,纵向长为h,在它的橫向中心线上不同位置处装有n(n<=10000)个点状的喷水装置,每个喷水装置i喷水的效果是让以它为中心半径为Ri的圆都被润湿。请在给出的喷水装置中选择尽量少的喷水装置,把整个草坪全部润湿。输入第一行输入一个正整数N表示共有n次测原创 2014-05-01 23:43:56 · 1160 阅读 · 0 评论 -
zoj 1025 &&poj 1065 Wooden Sticks
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=25Wooden SticksTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a pile of n wooden sticks. The length and weight of each s原创 2013-12-31 19:15:39 · 939 阅读 · 0 评论 -
CF 377 D. Exams
D. Examstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy has an exam period which will continue for原创 2016-10-31 20:22:15 · 1923 阅读 · 0 评论