luoguP1541 乌龟棋 题解(NOIP2010)

P1541 乌龟棋 题目

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<algorithm>
#include<queue>
#include<ctime>
#define ll long long
#define rg register
#define N 400
#define M 50
using namespace std;

int n,m;
ll ans;
int a[N],card[];
long long f[M][M][M][M];

inline int read()
{
    int s=,m=;char ch=getchar();
    while(ch!='-'&&(ch<''||ch>''))ch=getchar();
    if(ch=='-')m=-,ch=getchar();
    while(ch>=''&&ch<='')s=(s<<)+(s<<)+ch-'',ch=getchar();
    return s*m;
}

int main()
{
    n=read();m=read();
    for(rg int i=;i<=n;++i)
        a[i]=read();
    for(rg int i=;i<=m;++i)
        {
            int o=read();
            card[o]++;
        }
    for(rg int i=;i<=card[];++i)
        for(rg int j=;j<=card[];++j)
            for(rg int k=;k<=card[];++k)
                for(rg int l=;l<=card[];++l)
                    {
                        int now=i*+j*+k*+l+;
                        if(i>)
                            {
                                f[i][j][k][l]=max(f[i-][j][k][l]+a[now],f[i][j][k][l]);
                            }
                        if(j>)
                            {
                                f[i][j][k][l]=max(f[i][j-][k][l]+a[now],f[i][j][k][l]);
                            }
                        if(k>)
                            {
                                f[i][j][k][l]=max(f[i][j][k-][l]+a[now],f[i][j][k][l]);
                            }
                        if(l>)
                            {
                                f[i][j][k][l]=max(f[i][j][k][l-]+a[now],f[i][j][k][l]);
                            }
                        if(now==n)
                            {
                                ans=max(ans,f[i][j][k][l]);
                            }
                    }
    printf("%lld\n",ans+a[]);
    return ;
}