题解 | #字母收集#

#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
const int N = 510;

int dp[N][N];
int n, m;
int main() {
    scanf("%d%d", &n, &m);
    char tmp;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf(" %c", &tmp);
            if (tmp == 'l') {
                dp[i][j] = 4;
            } else if (tmp == 'o') {
                dp[i][j] = 3;
            } else if (tmp == 'v') {
                dp[i][j] = 2;
            } else if (tmp == 'e') {
                dp[i][j] = 1;
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            dp[i][j] += max(dp[i][j - 1], dp[i - 1][j]);
        }
    }
    printf("%d", dp[n][m]);
    return 0;
}