第七章的熟悉的味道,加上第九章一开始的嵌套正方形
因为终点不固定,似乎不方便递推
最后求所有出发点的dp值的最大值。
Run Time: 0.022s
#define UVa "9-1.10285.cpp" //Longest Run on a Snowboard
char fileIn[30] = UVa, fileOut[30] = UVa;
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
//Global Variables. Reset upon Each Case!
const int maxr = 100 + 5, maxc = 100 + 5, maxs = 1000 + 5;
int step[2][4] = {{-1, 0, 1, 0},{0, 1, 0, -1}};
int N, R, ......
阅读全文