解法一：把每个方块，当成3个点，地面设为p[0]点，有向图的 最长路，用floyd水过 其实应该用 dp做的。。 include<stdio.h> include<string.h> include<stdlib.h> include<algorithm> include<iostream> include<math.h> usingnamespacestd; intn,i,j,k; structnode{ inta,b,len; }p[100]; intmap[100][100]; in...