luogu P1541 乌龟棋

analysis

f设[a][b][c][d]:表示你出了a张爬行牌1，b张爬行牌2，c张爬行牌3，d张爬行牌4时的得分
方程：$f[i][j][k][z]=max(f[i-1][j][k][z],f[i][j-1][k][z],f[i][j][k-1][z],f[i][j][k][z-1])$f[i][j][k][z]=max(f[i−1][j][k][z],f[i][j−1][k][z],f[i][j][k−1][z],f[i][j][k][z−1])

code

#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(register int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define max(a,b) ((a>b)?a:b)
#define min(a,b) ((a<b)?a:b)
int n,m;
const int maxn=400;
const int maxm=140;
int a[maxn];
int b[maxm];
int f[maxm][maxm][maxm][maxm];
int num[5];
template<class T>void read(T &x)
{
	x=0;char r=getchar();T neg=1;
	while(r>'9'||r<'0'){if(r=='-')neg=-1;r=getchar();}
	while(r>='0'&&r<='9'){x=(x<<3)+(x<<1)+r-'0';r=getchar();}
	x*=neg;
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen("datain.txt","r",stdin);
	#endif
	read(n);read(m);
	clean(num,0);
	loop(i,1,n)read(a[i]);
	loop(i,1,m)
	{
		read(b[i]);
		++num[b[i]];
	}
	f[0][0][0][0]=a[1];
	loop(i,0,num[1])
	{
		loop(j,0,num[2])
		{
			loop(k,0,num[3])
			{
				loop(z,0,num[4])
				{
					int pos=i+j*2+k*3+z*4+1;
					if(i!=0)f[i][j][k][z]=max(f[i][j][k][z],f[i-1][j][k][z]+a[pos]);
					if(j!=0)f[i][j][k][z]=max(f[i][j][k][z],f[i][j-1][k][z]+a[pos]);
					if(k!=0)f[i][j][k][z]=max(f[i][j][k][z],f[i][j][k-1][z]+a[pos]);
					if(z!=0)f[i][j][k][z]=max(f[i][j][k][z],f[i][j][k][z-1]+a[pos]);
				}
			}
		}
	}
	printf("%d",f[num[1]][num[2]][num[3]][num[4]]);
	return 0;
}