紫芝的博客

点击打开链接Quoit DesignTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 61473    Accepted Submission(s): 16298Problem Description Have you ever playe...

 题意有N件衣服，每件衣服的函数量为ai，每分钟可以自然脱水1单位；有一个脱水机，每次只能用于一件衣服，每分钟脱水K单位，脱水时，不自然风干，求所有衣服全部脱水的最短时间分析二分查找最短时间，下界为1，上界为N件衣服中最大含水量，全部脱水的最小时间mid对于每一件衣服，若ai小于等于mid，则让其自然风干 若ai大于mid，则采用脱水机[X1]分钟+自然风干[X2]分钟的方法，那...

pairs  HDU - 5178 John has nn points on the X axis, and their coordinates are (x[i],0),(i=0,1,2,…,n−1) He wants to know how many pairs<a,b> that |x[b]−x[a]|≤k.(a<b)InputThe first line c...

CupTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11390    Accepted Submission(s): 3500Problem DescriptionThe WHU ACM Team has a big cup...

C. Read Timetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMad scientist Mike does not use slow hard disks. His modification of ...

工程时间限制：1000 ms  |  内存限制：65535 KB描述有n个工人做两个工程A和B，每个工程都被分为相同的m份，给你第i个工人做A中的一份需要的时间Xi秒，和做B中的一份所需时间Yi秒，问最短需要多少时间可以完成这两项工程。输入第一行是一个整数t (1 <= t <= 100),表示有t组测试数据;每组测试数据第一行有两个整数 n (1 <= n...

Strange fuctionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9479    Accepted Submission(s): 6447Problem DescriptionNow, here is a fuct...

Copying BooksTime Limit: 3000MS   Memory Limit: 10000K Total Submissions: 9617   Accepted: 3006 DescriptionBefore the invention of book-printing, it was very hard to make a copy of...

Aggressive cowsTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 19723   Accepted: 9330 DescriptionFarmer John has built a new long barn, with N (2 <= N <= 100,000...

Monthly ExpenseTime Limit: 2000MS   Memory Limit: 65536K Total Submissions: 33725   Accepted: 12620 DescriptionFarmer John is an astounding accounting wizard and has realized he mi...

题意：对于给定的一个方程：8 * x ^ 4 + 7 * x ^ 3 + 2 * x ^ 2 + 3 * x + 6 == Y；给定一个数Y，求x（0，100）值分析：先求函数 f(x)=8 * x ^ 4 + 7 * x ^ 3 + 2 * x ^ 2 + 3 * x + 6的导数，确定导数在定义域内的单调性，然后二分答案若导数ff(x)>0,则f(x)单调递增；若导数ff...

SubsequenceTime Limit: 1000MS   Memory Limit: 65536K Total Submissions: 20108   Accepted: 8587 DescriptionA sequence of N positive integers (10 < N < 100 000), each of them l...

Max SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 290991    Accepted Submission(s): 69018Problem DescriptionGiven a sequence a[1],a[...

Squares POJ - 2002 题意平面上有N个点，任取4个点，求能组成正方形的不同组合方式有多少种；相同的四个点，不同顺序构成的正方形视为同一正方形分析做法1先枚举两个点，通过计算得到另外两个点，然后检查点集中是否存在这两个点（tx,ty）绕坐标原点旋转W（弧度制）之后点的坐标为（x，y） double x = tx * cos(w) - ty * ...