OTTFF的博客

感觉原HDU上的题目名字不太懂 难道奇怪在function少了个n？这个问题跟HDU2199类似，但是这个函数并不是一个单调增函数，而且问题不再是堪根。但是其实是同一个问题，只有一个极值的函数最小值，其实就是导数的零点或者取值区间的边界点所以转化为二分搜索的堪根问题。但是感觉好像还有别的方法。#include #includeusing namespace std;typed

CupTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5443    Accepted Submission(s): 1735Problem DescriptionThe WHU ACM Team has a b

Toxophily Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1480    Accepted Submission(s): 772Problem DescriptionThe recreation cen

Design roadTime Limit: 2 Sec  Memory Limit: 256 MBSubmit: 306  Solved: 153[Submit][Status][Web Board]DescriptionYou need to design road from (0, 0) to (x, y) in plane with the lowest

Light BulbTime Limit: 1 Second      Memory Limit: 32768 KBCompared to wildleopard's wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in

Line beltTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3512    Accepted Submission(s): 1351Problem DescriptionIn a two-dimensi