【NOIP2010】乌龟棋 dp

【NOIP2010】乌龟棋

污龟棋~~~

因为出发点是 1 所以走 n 步获得的分数是 maps[n-1] 格子
所以等效于从 0 开始输入 maps 这样比较方便

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;

#define MAXN (360)
#define KA (45)
int maps[MAXN], ka[5], dp[KA][KA][KA][KA];

int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 0; i < n; ++ i)
        scanf("%d", &maps[i]);
    for(int i = 1; i <= m; ++ i){int x; scanf("%d", &x); ++ ka[x];}

    for(int i = 0; i <= ka[1]; ++ i)
        for(int j = 0; j <= ka[2]; ++ j)
            for(int k = 0; k <= ka[3]; ++ k)
                for(int l = 0; l <= ka[4]; ++ l)
                {
                    int tmp = 0;
                    if(i) tmp = max(tmp,dp[i - 1][j][k][l]);
                    if(j) tmp = max(tmp,dp[i][j - 1][k][l]);
                    if(k) tmp = max(tmp,dp[i][j][k - 1][l]);
                    if(l) tmp = max(tmp,dp[i][j][k][l - 1]);
                    dp[i][j][k][l] = tmp + maps[i*1+j*2+k*3+l*4];
                }
    cout << dp[ka[1]][ka[2]][ka[3]][ka[4]] << endl;
    return 0;
}