T_T

看完解题报告后，感觉这题出的非常好，

题目链接：http://poj.org/problem?id=1017 Limit: 1000MS   Memory Limit: 10000K Total Submissions: 44985   Accepted: 15208 Description A factory produces products packed in

题目链接：http://acdream.info/problem?pid=1224

题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=4803 Poor Warehouse Keeper Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1493    Accepted

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5014 Number Sequence Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 681    Accepted Submis

[cpp] view plaincopyprint? #include   #include   #include   #include   #include   #include   using namespace std;   const int maxn=55;   const int inf=1 const double eps=1e-6; 

昨天比赛的时候没有做出来，本来是想用贪心的，但是贪了好久都没有招， 今天在网上搜了解题报告~好像说这是一类区间选点问题： 有一个好的做法： （1）首先把题目中的时间全转化为分钟，那么区间就在0-1440中间  （2）对于n组人，有一个si 和一个ei，那么开个数组， cnt[si]+=d;  cnt[ei]-=d;   ( 3 ) 也就是说在数轴上讲到达的这点加上d,离开的这点减去d;

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=12 喷水装置（二） 时间限制：3000 ms  |  内存限制：65535 KB 难度：4 描述有一块草坪，横向长w,纵向长为h,在它的橫向中心线上不同位置处装有n(n<=10000)个点状的喷水装置，每个喷水装置i喷水的效果是让以它为中心半径为Ri

Teacher Mai has a kingdom. A monster has invaded this kingdom, and Teacher Mai wants to kill it. Monster initially has h HP. And it will die if HP is less than 1. Teacher Mai and monster take tu

选自刘汝佳白皮书 问题描述：数轴上有n个闭区间[ai,bi].取jinglinag

问题描述：数轴上有n个开区间，选择尽量多的区间，使得这些区间liangl

链接：CLICK here There 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. Th

转自： 259. Printed PR time limit per test: 0.5 sec. memory limit per test: 65536 KB input: standard output: standard Small PR-agency got an order to print a very big lot of agitational materia

C - Table Decorations Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeCodeForces 478C Description You have r red, g green and b blue balloons. To d