Daioo 随笔

hdu 3714 Error Curves Josephina is a clever girl and addicted to Machine Learning recently. hdu 4717 The Moving Points There are N points in total. Every point moves in certain direction and certain speed.

题目描述Compared to wildleopard’s wealthiness, his brother mildleopard is rather poor. His house is narrow and he has only one light bulb in his house. Every night, he is wandering in his incommodious hous

引言 二分搜索法，是通过不断缩小解可能存在的范围，从而求得问题最优解的方法。在ACM竞赛中，解题通常要与其他算法，如贪心相结合提高程序效率。 二分对于中位数有两种取法： 上位中位数mid=lenth/2 下位中位数mid=(lenth+1)/2-1 或 mid=(lenth-2)/2 下文将详细分析。 STL中的预定函数 1. lower_bound lower_bou...