https://blog.youkuaiyun.com/bigning1118zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/bigning1118/article/details/39048671https://blog.youkuaiyun.com/bigning1118/article/details/39048671bigning1118Thu, 04 Sep 2014 10:09:44 +0800https://blog.youkuaiyun.com/bigning1118/article/details/38709367https://blog.youkuaiyun.com/bigning1118/article/details/38709367bigning1118Wed, 20 Aug 2014 17:38:37 +0800https://blog.youkuaiyun.com/bigning1118/article/details/24848809https://blog.youkuaiyun.com/bigning1118/article/details/24848809bigning1118Thu, 01 May 2014 20:34:37 +0800https://blog.youkuaiyun.com/bigning1118/article/details/17335291https://blog.youkuaiyun.com/bigning1118/article/details/17335291bigning1118Sun, 15 Dec 2013 16:45:33 +0800https://blog.youkuaiyun.com/bigning1118/article/details/16852423https://blog.youkuaiyun.com/bigning1118/article/details/16852423bigning1118Wed, 20 Nov 2013 22:58:32 +0800https://blog.youkuaiyun.com/bigning1118/article/details/15035303https://blog.youkuaiyun.com/bigning1118/article/details/15035303bigning1118Sun, 10 Nov 2013 19:04:18 +0800https://blog.youkuaiyun.com/bigning1118/article/details/8579318https://blog.youkuaiyun.com/bigning1118/article/details/8579318bigning1118Tue, 12 Feb 2013 16:15:14 +0800https://blog.youkuaiyun.com/bigning1118/article/details/6647155https://blog.youkuaiyun.com/bigning1118/article/details/6647155bigning1118Sat, 30 Jul 2011 19:46:35 +0800=A[i],即任意节点的值都小于其父节点   利用最大堆排序时，首先将待排序数组整理成最大]]>https://blog.youkuaiyun.com/bigning1118/article/details/6626724https://blog.youkuaiyun.com/bigning1118/article/details/6626724bigning1118Fri, 22 Jul 2011 19:35:59 +0800https://blog.youkuaiyun.com/bigning1118/article/details/6626682https://blog.youkuaiyun.com/bigning1118/article/details/6626682bigning1118Fri, 22 Jul 2011 19:04:25 +0800https://blog.youkuaiyun.com/bigning1118/article/details/6626643https://blog.youkuaiyun.com/bigning1118/article/details/6626643bigning1118Fri, 22 Jul 2011 18:42:42 +0800https://blog.youkuaiyun.com/bigning1118/article/details/6462203https://blog.youkuaiyun.com/bigning1118/article/details/6462203bigning1118Thu, 02 Jun 2011 20:14:00 +0800题目描述：
给你m个东西，放在n个相同的盒子中（相同，即不计顺序），每个盒子可以放任意多，问有多少种放法。
这是组合数学母函数的典型应用。

解题报告：
整数划分问题。
dp[i][j] 表示 j 个东西放 i 个盒子中的方法数。则 i 个盒子的状态只有 2 种：有空的，和没有空的。
即dp[i][j] = 有空的 + 没有空的。
情况1：j < i
没有空的方法数为 0，有空的时，把一个盒子单独拿出来当做]]>https://blog.youkuaiyun.com/bigning1118/article/details/6444370https://blog.youkuaiyun.com/bigning1118/article/details/6444370bigning1118Wed, 25 May 2011 11:27:00 +0800https://blog.youkuaiyun.com/bigning1118/article/details/6419365https://blog.youkuaiyun.com/bigning1118/article/details/6419365bigning1118Sat, 14 May 2011 11:01:00 +0800以下方法时间复杂度为  O(log2(m))
long long myCal(int n,int m)
{
 long long t=1;
 while(m)
 {
  if(m&1)
   t=t*n;
  n=n*n;
  m=m>>1;
 }
 return t;
}]]>https://blog.youkuaiyun.com/bigning1118/article/details/6410134https://blog.youkuaiyun.com/bigning1118/article/details/6410134bigning1118Tue, 10 May 2011 20:50:00 +0800从长为n的全为正数的数组a中，找到个数最少的连续子数列使其和>=m
example:
n=10,m=15,a[10]={5 1 3 5 10 7 4 9 2 8},结果为2
 
 
 
algorithm:
维护一个队列，这个队列中的数正好满足要求，队列头从数组起始位置往右移动，遍历一遍后，输出队列出现过的个数最少时的队列元素个数
 
 
int cal(int * a,int n,int m)<]]>https://blog.youkuaiyun.com/bigning1118/article/details/6405862https://blog.youkuaiyun.com/bigning1118/article/details/6405862bigning1118Mon, 09 May 2011 10:00:00 +08001.       Sort函数，sort函数不仅可以对STL中的容器进行排序，还可对数组排序。如：
#include
#include
#include
usingnamespacestd;
 
boolcomp(inta,intb){returna 
intmain()
{
     inta[5]]]>https://blog.youkuaiyun.com/bigning1118/article/details/6204052https://blog.youkuaiyun.com/bigning1118/article/details/6204052bigning1118Thu, 24 Feb 2011 09:08:00 +0800用openCV写一个简单的人脸检测程序，但当大规模检测(>2000幅图片)时存在严重的内存泄露，导致程序崩溃，一看手册上的例子才知道，缺下面这两个release
与cvCreateMemStorage对应的cvReleaseMemStorage( &storage );
与cvLoad( cascade_path )对应的cvReleaseHaarClassifierCascade( &cascade )，很简单的两句话，要是早点看看手册就知道了]]>https://blog.youkuaiyun.com/bigning1118/article/details/6095159https://blog.youkuaiyun.com/bigning1118/article/details/6095159bigning1118Thu, 23 Dec 2010 21:23:00 +0800https://blog.youkuaiyun.com/bigning1118/article/details/5756967https://blog.youkuaiyun.com/bigning1118/article/details/5756967bigning1118Fri, 23 Jul 2010 09:29:00 +0800下面做几种频域锐化滤波器（即高通滤波）
2.1理想高通滤波

对下面这个图作理想高通滤波：

D0=15：

D0=30：

D0=80：

可以看出，振铃效果明显。
 
2.2相对的，还有巴特沃思高通滤波（BHPF）：

D0=15：

D0=30：

D0=80：

2.3：高斯高通滤]]>https://blog.youkuaiyun.com/bigning1118/article/details/5756928https://blog.youkuaiyun.com/bigning1118/article/details/5756928bigning1118Fri, 23 Jul 2010 09:09:00 +0800    基本的频域滤波模型为：
G（u,v）=H(u,v)F(u,v)
    其中F(u,v)为图像的傅利叶变换，H(u,v)为使用的滤波器。
1.1 理想低通滤波器
             D0 为像素点到图像中心点的欧氏距离
    效果：原图（500*500）：

D0 =5：

D0 =15：

 振铃效果明显。
D0 =3]]>