adobemomo的博客

给出一个长度为n的序列，求连续最大和。递归求解是分别求出位于左半部分和右半部份的最优解。合并是找起点在左边的，终点在右边的最优解，并和左右部分最优的进行比较。代码如下。时间复杂度o(NlogN)int maxsum(int *A, int x, int y){ int middle, value, L, R, mmax; if(y-x == 1

http://www.cppblog.com/csu-yx-2013/archive/2013/10/09/166565.html随机化算法

One day Alex decided to remember childhood when computers were not too powerful and lots of people played only default games. Alex enjoyed playing Minesweeper that time. He imagined that he saved worl...