hdu, KMP algorithm, linear string search algorithm, a nice reference provided 分类： hdoj 2015-07-18 13:40 144人阅读评论(0) 收藏

【hdu, KMP algorithm, linear string search algorithm, a nice reference provided 分类： hdoj 2015-07-18 13:40 144人阅读评论(0) 收藏】的更多相关文章

hdu, KMP algorithm, linear string search algorithm, a nice reference provided 分类： hdoj 2015-07-18 13:40 144人阅读评论(0) 收藏

reference: Rabin-Karp and Knuth-Morris-Pratt Algorithms By TheLlama– TopCoder Member https://www.topcoder.com/community/data-science/data-science-tutorials/introduction-to-string-searching-algorithms/ // to be improved #include <cstdio> #include <…

Hdu 1506 Largest Rectangle in a Histogram 分类： Brush Mode 2014-10-28 19:16 93人阅读评论(0) 收藏

Largest Rectangle in a Histogram Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11706 Accepted Submission(s): 3219 Problem Description A histogram is a polygon composed of a sequence of rec…

灰度世界算法（Gray World Algorithm）分类：图像处理 Matlab 2014-12-07 18:40 874人阅读评论(0) 收藏

人的视觉系统具有颜色恒常性,能从变化的光照环境和成像条件下获取物体表面颜色的不变特性,但成像设备不具有这样的调节功能, 不同的光照环境会导致采集的图像颜色与真实颜色存在一定程度的偏差,需要选择合适的颜色平衡(校正)算法,消除光照环境对颜色显现的影响.灰度世界算法是最常用平衡算法. 一.灰度世界算法灰度世界算法以灰度世界假设为基础,该假设认为:对于一幅有着大量色彩变化的图像,,三个分量的平均值趋于同一灰度值.从物理意义上讲,灰色世界法假设自然界景物对于光线的平均反射的均值在总体上是个定值,这…

HDU 2042 不容易系列之二 [补6.24] 分类： ACM 2015-06-26 20:40 9人阅读评论(0) 收藏

不容易系列之二 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19635 Accepted Submission(s): 15810 Problem Description 你活的不容易,我活的不容易,他活的也不容易.不过,如果你看了下面的故事,就会知道,有位老汉比你还不容易. 重庆市郊黄泥板村的徐老汉(大号徐东海,简称XDH)…

hdu 1712, multiple-choice knapsack, 分类： hdoj 2015-07-18 13:25 152人阅读评论(0) 收藏

reference: 6.4 knapsack in Algorithms(算法概论), Sanjoy Dasgupta University of California, San Diego Christos Papadimitriou University of California at Berkeley Umesh Vazirani University of California at Berkeley the unbounded knapsack and 0-1 knapsack a…

hdu 1034 (preprocess optimization, property of division to avoid if, decreasing order process) 分类： hdoj 2015-06-16 13:32 39人阅读评论(0) 收藏

IMO, version 1 better than version 2, version 2 better than version 3. make some preprocess to make you code simple and efficient. Here divide the input by 2, so you don't have to do dividsion on each loop. version 1 is best thanks to http://www.cnbl…