noip 2010 乌龟棋

#include<cstdio>
#include<algorithm>
#include<cstring>
#define int long long
//by mars_ch
using namespace std;
int n,m;
int a[355];
int num[5];
int f[45][45][45][45];
signed main()
{
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
}
for(int i=1;i<=m;i++)
{
int x;
scanf("%lld",&x);
num[x]++;
}
f[0][0][0][0]=a[1];
for(int i=0;i<=num[1];i++)
{
for(int j=0;j<=num[2];j++)
{
for(int k=0;k<=num[3];k++)
{
for(int l=0;l<=num[4];l++)
{
f[i+1][j][k][l]=max(f[i+1][j][k][l],f[i][j][k][l]+a[i+j*2+k*3+l*4+2]);

f[i][j+1][k][l]=max(f[i][j+1][k][l],f[i][j][k][l]+a[i+j*2+k*3+l*4+3]);

f[i][j][k+1][l]=max(f[i][j][k+1][l],f[i][j][k][l]+a[i+j*2+k*3+l*4+4]);

f[i][j][k][l+1]=max(f[i][j][k][l+1],f[i][j][k][l]+a[i+j*2+k*3+l*4+5]);
}
}
}
}
printf("%lld\n",f[num[1]][num[2]][num[3]][num[4]]);
return 0;
}