aNoobCoder的博客

#include <iostream> #include <stdio.h>#include <assert.h>#include <stdlib.h>#include <String.h>#define MAX 100typedef struct Matrix{ int left; int right;}Matrix;using namespace std;//自底向上的

#include<iostream> using namespace std;void Merge(int a[], int left, int center, int right) { int *t = new int[right-left+1];//存放被排序的元素 int i = left; int j = center + 1;

只是代码实现，讲解和原理可以看算导的dp部分，也可以看这位的博客，讲的也比较清楚。http://blog.youkuaiyun.com/hrn1216/article/details/51534607#include &lt;iostream&gt;#include &lt;String.h&gt;#define MAXLENGTH 1000using namespace std;int...