暴力 二分查找 三分查找
文章平均质量分 87
Tian_Fei
111
展开
-
UVA 10020 — Minimal coverage
The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M].The In原创 2014-07-24 10:51:33 · 566 阅读 · 0 评论 -
Squares(存在多少正方形,暴力枚举 )
SquaresTime Limit: 3500MS Memory Limit: 65536KTotal Submissions: 17128 Accepted: 6513DescriptionA square is a 4-sided polygon whose sides have equal length and原创 2015-05-01 16:27:33 · 564 阅读 · 0 评论 -
Dropping tests
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7201 Accepted: 2499DescriptionIn a certain course, you take n tests. If you get ai out o原创 2015-04-12 19:53:03 · 540 阅读 · 0 评论 -
Coverage 圆与直线的交点
CoverageTime Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 7536A cell phone user is travelling along a line s原创 2015-04-12 18:37:55 · 541 阅读 · 0 评论 -
poj K Best 最大化平均值 二分搜索
K BestTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 6315 Accepted: 1689Case Time Limit: 2000MS Special JudgeDescriptionDemy has n jewels.原创 2015-04-11 21:35:25 · 394 阅读 · 0 评论 -
Cable master
Cable masterTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27070 Accepted: 5757DescriptionInhabitants of the Wonderland have decided to hold a region原创 2015-04-09 16:55:35 · 316 阅读 · 0 评论 -
bnuoj Trick or Treat(三分查找)
Trick or TreatTime Limit: 10000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSpecial JudgePrev Submit Status Statistics Discuss Next原创 2015-04-29 06:57:07 · 524 阅读 · 0 评论 -
Aggressive cows
Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7184 Accepted: 3578DescriptionFarmer John has built a new long barn, with N (2 His原创 2015-04-09 17:08:36 · 313 阅读 · 0 评论 -
Pie poj 二分求最大平均值
PieTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11799 Accepted: 4084 Special JudgeDescriptionMy birthday is coming up and traditionally I'm ser原创 2015-04-09 20:17:28 · 337 阅读 · 0 评论 -
Open-air shopping malls 两圆面积相交,二分搜索半径
Open-air shopping mallsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2078 Accepted Submission(s): 745Problem DescriptionThe cit原创 2015-04-14 10:53:39 · 485 阅读 · 0 评论 -
HDU 1316 —How many Fibs?
Recall the definition of the Fibonacci numbers:f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3)Given two numbers a and b, calculate how many Fibonacci numbers are in the range [ a, b].In原创 2014-07-22 10:12:28 · 473 阅读 · 0 评论 -
Uva 10341 — Solve It
Solve the equation: p*e-x+ q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0 where 0 x .InputInput consists of multiple test cases and terminated by an EOF. Each test case cons原创 2014-07-22 17:17:50 · 477 阅读 · 0 评论 -
Uva 10487 — Closest Sums
Given is a set of integers and then a sequence of queries. A query gives you a number and asks to find a sum of two distinct numbers from the set, which is closest to the query number.InputInput c原创 2014-07-22 15:57:10 · 429 阅读 · 0 评论 -
UVa 270 — Lining Up
``How am I ever going to solve this problem?" said the pilot.Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dangerous area. Furthermo原创 2014-07-24 15:05:38 · 488 阅读 · 0 评论 -
hdu 2199Can you solve this equation?
原题链接code:数学题要用数学方法解,在[0,100]上函数为单调增函数,二分,注意精度;#include#includedouble fun(double x){ return 8*pow(x,4) + 7*pow(x,3) + 2*pow(x,2) + 3*x + 6;}int main(){ int cas; double y,y1,y原创 2015-08-08 08:41:01 · 405 阅读 · 0 评论