题解 | #迷宫问题#

r,c=map(int,input().split())
map1=[]
def score(i,j,map1):
    if map1[i][j]=='l':
        return 4
    elif map1[i][j]=='o':
        return 3
    elif map1[i][j]=='v':
        return 2
    elif map1[i][j]=='e':
        return 1
    else:
        return 0
for i in range(r):
    map1.append(input())
dp=[[0]*(len(map1[0])+1) for _ in range(len(map1)+1)]
for i in range(1,len(map1)+1):
    for j in range(1,len(map1[0])+1):
        dp[i][j]=score(i-1,j-1,map1)+max(dp[i-1][j],dp[i][j-1]) #理解一下这句话就行了
print(dp[-1][-1])

很简单很好理解~