乌龟棋

乌龟棋

具体代码如下

#include<iostream>
#include<cstring>

using namespace std;

const int N = 355, M = 41;

int n, m, g[5];
int f[M][M][M][M], w[N];

int main(){
    
    cin >> n >> m;
    
    for(int i = 1; i <= n; ++ i) cin >> w[i];
    
    for(int i = 1; i <= m; ++ i){
        
        int x;
        cin >> x;
        g[x] ++;
    }
    
    f[0][0][0][0] = w[1];
    
    for(int a = 0; a <= g[1]; ++ a)
        for(int b = 0; b <= g[2]; ++ b)
            for(int c = 0; c <= g[3]; ++ c)
                for(int d = 0; d <= g[4]; ++ d){
                    
                    //r多加1个1是因为我们是从1号点开始走的
                    int r = 1 + a + b * 2 + c * 3 + d * 4;
                    if(a != 0) f[a][b][c][d] = max(f[a][b][c][d], f[a - 1][b][c][d] + w[r]);
                    if(b != 0) f[a][b][c][d] = max(f[a][b][c][d], f[a][b - 1][c][d] + w[r]);
                    if(c != 0) f[a][b][c][d] = max(f[a][b][c][d], f[a][b][c - 1][d] + w[r]);
                    if(d != 0) f[a][b][c][d] = max(f[a][b][c][d], f[a][b][c][d - 1] + w[r]);
                }
    
    cout << f[g[1]][g[2]][g[3]][g[4]] << endl;
    
    return 0;
}