题解 | 字母收集

//  #牛客春招刷题训练营# https://www.nowcoder.com/discuss/726480854079250432
//  在适应一款类似vim的插件格式有点怪怪的
//  我一看到路劲就写了搜索结果超时了，正解为dp，代码如下
#include <iostream>
#include <algorithm>
#include <vector>
  #define pre(i,j,k) for(int i = j; i < k; i++)
using namespace std;
int n, m;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
vector<vector<int>> a(n + 1, vector<int>(m+1,0));
  char c;
pre(i, 1, n+1)
pre(j, 1, m+1){
      cin >> c;
      if (c == 'l') a[i][j] = 4;
      else if (c == 'o') a[i][j] = 3;
      else if (c == 'v') a[i][j] = 2;
      else if (c == 'e') a[i][j] = 1;
  }
pre(i, 1, n+1)
  pre(j, 1, m+1)
    a[i][j] = max(a[i - 1][j],a[i][j- 1])+a[i][j];
cout << a[n][m];
  return 0;
}