摘要：problemsolutioncodes//f[i][j]:以(i,j)为终点的最长路是是多少//f[i][j] = f(它四周的比他高的方块的最长路)+1#include#includeusing namespace std;const int maxn = 110... 阅读全文