hdu 3720 Arranging Your Team dfs

思路很简单直接暴力，只是代码复杂了点

#include <iostream>
#include <string>
#include <map>
#define Min -0x3f3f3f3f
using namespace std;

map<string,int> m;

struct node{
    int k,val[25],name[25];
}ar[5];
int cnt,ans,vis[25],Map[25][25];

int judge()
{
    int i,j,num=0;
    for (i=0;i<10;i++)
    {
        for (j=i+1;j<11;j++)
            num+=Map[vis[i]][vis[j]];
    }
    return num;
}

void dfs(int index,int i,int x,int sum,int l)
{
    int j;
    if(x==0&&index==1)
    {
        dfs(0,0,1,sum,l);
        return;
    }
    if(x==1&&index==4)
    {
        dfs(0,0,2,sum,l);
        return;
    }
    if(x==2&&index==4)
    {
        dfs(0,0,3,sum,l);
        return;
    }
    if(x==3&&index==2)
    {
        int rest=judge();
        if(sum+rest>ans)ans=sum+rest;
        return;
    }
    for (j=i;j<ar[x].k;j++)
    {
        vis[l]=ar[x].name[j];
        dfs(index+1,j+1,x,sum+ar[x].val[j],l+1);
    }
}

int main()
{
    int i,n,val,name;
    string s,pos;
    while (cin>>s>>val>>pos)
    {
        memset(ar,0,sizeof(ar));
        memset(Map,0,sizeof(Map));
        cnt=0;
        ans=Min;
        if(m.find(s)==m.end())m[s]=cnt++;
        name=m[s];
        if(pos=="goalkeeper")
        {
            ar[0].name[ar[0].k]=name;
            ar[0].val[ar[0].k++]=val;
        }
        else if(pos=="defender")
        {
            ar[1].name[ar[1].k]=name;
            ar[1].val[ar[1].k++]=val;
        }
        else if(pos=="midfielder")
        {
            ar[2].name[ar[2].k]=name;
            ar[2].val[ar[2].k++]=val;
        }
        else 
        {
            ar[3].name[ar[3].k]=name;
            ar[3].val[ar[3].k++]=val;
        }
        for (i=0;i<22;i++)
        {
            cin>>s>>val>>pos;
            if(m.find(s)==m.end())m[s]=cnt++;
            name=m[s];
            if(pos=="goalkeeper")
            {
                ar[0].name[ar[0].k]=name;
                ar[0].val[ar[0].k++]=val;
            }
            else if(pos=="defender")
            {
                ar[1].name[ar[1].k]=name;
                ar[1].val[ar[1].k++]=val;
            }
            else if(pos=="midfielder")
            {
                ar[2].name[ar[2].k]=name;
                ar[2].val[ar[2].k++]=val;
            }
            else 
            {
                ar[3].name[ar[3].k]=name;
                ar[3].val[ar[3].k++]=val;
            }
        }
        scanf("%d",&n);
        string a,b;
        int c,A,B;
        for (i=0;i<n;i++)
        {
            cin>>a>>b>>c;
            A=m[a];
            B=m[b];
            Map[A][B]=Map[B][A]=c;
        }
        dfs(0,0,0,0,0);
        if(ans!=Min)cout<<ans<<endl;
        else cout<<"impossible"<<endl;
        m.clear();
    }
    return 0;
}