AlgorithmCourse
AlgorithmCourse
棋盘覆盖
#include "recursive/ChessboardOverlay.h"
int main(){
solve(2,2,4);
}最长子序列
#include "dp/LCS.h"
using namespace std;
int main(){
string a = "123", b = "!2";
cout << lcs(a, b) << endl;
}最大子段和
#include "dp/MSP.h"
using namespace std;
int main(){
int a[] = {1,2,-4,2,4,8,10,-7,5,10};
cout << msp(a, 10) << endl;
}