AcWing 312. 乌龟棋
原题链接
简单
作者:
autumn_0
,
2024-01-17 20:44:49
,
所有人可见
,
阅读 54
C++ 代码
#include <iostream>
using namespace std;
const int N = 40, M = 360;
int f[N][N][N][N];
int a[M];
int h[5];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
for(int i = 1; i <= m; i ++ )
{
int x;
scanf("%d", &x);
h[x] ++;
}
f[0][0][0][0] = a[1];
for(int i = 0; i <= h[1]; i ++ )
for(int j = 0; j <= h[2]; j ++ )
for(int k = 0; k <= h[3]; k ++ )
for(int s = 0; s <= h[4]; s ++ )
{
int d = 1 + i * 1 + j * 2 + k * 3 + s * 4;
int &v = f[i][j][k][s];
if(i) v = max(v, f[i - 1][j][k][s] + a[d]);
if(j) v = max(v, f[i][j - 1][k][s] + a[d]);
if(k) v = max(v, f[i][j][k - 1][s] + a[d]);
if(s) v = max(v, f[i][j][k][s - 1] + a[d]);
}
cout << f[h[1]][h[2]][h[3]][h[4]] << endl;
return 0;
}