题解 | 字母收集

#include <bits/stdc++.h>
using namespace std;

const int N = 520;
int n,m,dp[N][N],ans;
char g[N][N];

int main(){
    cin>>n>>m;
    for(int i = 1;i<=n;i++) scanf("%s",g[i]+1);

    for(int i = 1;i<=n;i++){
        for(int j = 1;j<=m;j++){
            dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
            if(g[i][j]=='l') dp[i][j] += 4 ;
            else if(g[i][j]=='o') dp[i][j] += 3;
            else if(g[i][j]=='v') dp[i][j] += 2;
            else if(g[i][j]=='e') dp[i][j]++;
            ans = max(ans,dp[i][j]);
        }
    }
    cout<<ans;

    return 0;
}