HDU 3720 Arranging Your Team

先分组，然后暴力；注意  初始化时不要为0 会有负数；我直接二进制枚举； dfs是正解；呵呵

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

int arr[][];
map<string,int>mp;
char str[],cha[];
struct date{
     int val,i;
     bool operator < ( const date &a )const {
        if( a.val != val )return a.val < val;
        return a.i < i;
     }
};
vector<date>v[];
vector<date>s[];
char sss[][] = {"","goalkeeper","defender","midfielder","striker"};
int main( )
{
    int num;
    while( scanf("%s%d%s",str,&num,cha) != EOF )
    {
        mp.clear(); memset( arr,,sizeof(arr) );
        for( int i = ; i < ; i++ )v[i].clear();
        for( int i = ; i < ; i++ )s[i].clear();
         mp[str] = ;  date temp; temp.val = num; temp.i = ;
        for( int i = ; i <= ; i++ )
          if( strcmp(cha,sss[i]) ==  ) v[i].push_back(temp);
        for( int i = ; i <= ; i++ )
        {
            scanf("%s%d%s",str,&num,cha); mp[str] = i;
            date temp; temp.val = num; temp.i = i;
            for( int j = ; j <= ; j++ )
              if( strcmp(cha,sss[j]) ==  )v[j].push_back(temp);
        }
        int now; cin>>now;
        while( now-- )
        {
            cin>>str>>cha>>num; arr[mp[str]][mp[cha]] = arr[mp[cha]][mp[str]] = num;
        }//cout<<v[1].size()<<" "<<v[2].size()<<" "<<v[3].size()<<" "<<v[4].size()<<endl;
        if( v[].size() <  || v[].size() <  || v[].size() <  || v[].size() <  )
        {
            cout<<"impossible"<<endl;
            continue;
        }
        for( int i = ; i < v[].size(); i++ )
        {
            date temp; temp = v[][i]; temp.i = <<(temp.i-);
            s[].push_back( temp );
        }
        for( int i = ; i < v[].size(); i++ )
        for( int j = i+; j < v[].size(); j++ )
        for( int k = j+; k < v[].size(); k++ )
        for( int l = k+; l < v[].size(); l++ )
        {
            int ans = ; int val = ;
            date temp; temp = v[][i]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][j]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][k]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][l]; ans += (<<(temp.i-));val += temp.val;
            temp.val = val; temp.i = ans;
            s[].push_back(temp);
        }
        for( int i = ; i < v[].size(); i++ )
        for( int j = i+; j < v[].size(); j++ )
        for( int k = j+; k < v[].size(); k++ )
        for( int l = k+; l < v[].size(); l++ )
        {
            int ans = ; int val = ;
            date temp; temp = v[][i]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][j]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][k]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][l]; ans += (<<(temp.i-));val += temp.val;
            temp.val = val; temp.i = ans;
            s[].push_back(temp);
        }
        for( int i = ; i < v[].size(); i++ )
        for( int j = i+; j < v[].size(); j++ )
        {
            int ans = ; int val = ;
            date temp; temp = v[][i]; ans += (<<(temp.i-));val += temp.val;
                       temp = v[][j]; ans += (<<(temp.i-));val += temp.val;
            temp.val = val; temp.i = ans;
            s[].push_back(temp);
        }
        int Max = (<<)*-;
        for( int i = ; i < s[].size(); i++ )
        for( int j = ; j < s[].size(); j++ )
        for( int k = ; k < s[].size(); k++ )
        for( int l = ; l < s[].size(); l++ )
        {
            int ans = s[][i].i+s[][j].i+s[][k].i+s[][l].i;
            int val = s[][i].val+s[][j].val+s[][k].val+s[][l].val;
            vector<int>n; n.clear();
            for( int t = ; t < ; t++ )
            if( ans&(<<t) )n.push_back(t+);
            for( int x = ; x < n.size(); x++ )
            for( int y = x+; y < n.size(); y++ )
            val += arr[n[x]][n[y]];
            Max = max( Max,val );
        }
        cout<<Max<<endl;
    }
    return ;
}