18342075 米家龙 第二章1

int twoEnd(int begin, int end, int arr[])

{

// 终止递归

extChooseFront ? begin + 2 : begin + 1, nextChooseFront ? end : end - 1, arr);

// 先手选后

nextChooseFront = arr[begin] >= arr[end - 1];

int endChoose = arr[end] - arr[nextChooseFront ? begin : end - 1] + twoEnd(nextC

hooseFront ? begin + 1 : begin, nextChooseFront ? end - 1 : end - 2, arr);

return frontChoose > endChoose ? frontChoose : endChoose;

}

class unit

{

private:

int res;

bool hasCal;

public:

unit()

{

this->res = 0;

this->hasCal = hasCal;

{

void setHasCal(bool newHasCal)

{

this->hasCal = newHasCal;

}

int getRes()

{

return this->res;

}

void setRes(int newRes)

{

this->res = newRes;

}

int twoEnd(int begin, int end, int arr[])

{

// 终止递归

if (begin == end - 1)

{

matrix[begin][end].setHasCal(true);

matrix[begin][end].setRes(arr[begin] > arr[end] ? arr[begin] - arr[end] : arr[

end] - arr[begin]);

// 如果已经存在结果

// 先手选前

extChooseFront ? begin + 2 : begin + 1, nextChooseFront ? end : end - 1, arr);

// 先手选后

nextChooseFront = arr[begin] >= arr[end - 1];

int endChoose = arr[end] - arr[nextChooseFront ? begin : end - 1] + twoEnd(nextC

hooseFront ? begin + 1 : begin, nextChooseFront ? end - 1 : end - 2, arr);

matrix[begin][end].setHasCal(true);

matrix[begin][end].setRes(frontChoose > endChoose ? frontChoose : endChoose);

return matrix[begin][end].getRes();

}