阿里在线测评.pdfVIP

阿⾥在线测评 在⼀个10*10的棋盘上，每个格⼦有⼀个分数值（⾮负整数）。⼀个棋⼦从棋盘上的某⼀个起始位置移动到某⼀个终⽌位置。棋⼦每次在棋 盘上可以朝上下左右4个⽅向移动，⼀共最多可以移动n步。每移动到⼀个格⼦上，则获得格⼦上相应分数。初始位置的分数⾃动获得。请 问棋⼦如何移动，才能获得最多分数。建议使⽤C++。 #include vector #include time.h #include iostream using namespace std; typedef struct{ int x; int y; int score; }Cor; int solution int x, int y, int n, int endx, int endy); int inRange int x, int y, int minx, int miny, int maxx, int maxy, int endx, int endy, int n, int i); //10*10的棋盘 int T[ 10][10] = {\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,0,9,2,4,8,2,9,4},\ {6,2,999,9,2,4,8,2,9,4} }; int main() { clock_t start,finish; double total; start=clock(); int res = solution 1, 2, 11, 9, 2); printf result:%d, res); finish=clock(); total= double)(finish-start)/CLOCKS_PER_SEC; return 0; } /* *描述:解决棋盘最多分数问题 *输⼊: x:起始位置x坐标 * y:起始位置y坐标 * n:⼀共⾛n步 * endx:结束位置x坐标 * endy:结束位置y坐标 * 输出:最⼤分数值 */ int solution int x, int y, int n, int endx, int endy) { vectorCor score,score2; Cor first; first.x = x;