HDU 1074 状态压缩dp

把所有作业做与没做的状态压缩为1与0，这样我们就可以用一个小于2ⁿ的数字来表示任意作业做与没做的状态。很显然，所有作业全做完了的状态一定是由某一科没做完演变而来，即111肯定是由011，101，110三个状态之一演变而来，我们只需要找出这三种状态，逐个比较得出减分最少的一个路径即可。

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#define N 70000
#define ll long long
#define INF 0x7fffffff
using namespace std;
struct Subject{
    string name;
    int date,waste;
    Subject(string a = " ",int b = 0,int c = 0){
        name = a,date = b,waste = c;
    }
};

bool cmp(Subject a,Subject b){
    return a.name > b.name;
}

Subject l[N];
int top = 0;
int n;
int cases = 0;
int dp[N],time[N],pre[N],book[N];
int main(){
	int i,j;
    string a;
    int b,c;
    scanf("%d",&cases);
    while (cases > 0)
    {
        cases--;
        top = 0;
        scanf("%d",&n);
        for(i=1;i<=n;i++){
            cin>>a>>b>>c;
            top++;
            l[top] = Subject(a,b,c);
        }
        sort(l+1,l+1+n,cmp);
        memset(dp,0x3f,sizeof(dp));
        memset(time,0,sizeof(time));
        memset(pre,-1,sizeof(pre));
        memset(book,-1,sizeof(book));
        dp[0] = 0;
        int len = pow(2,n);
        for(i=1;i<len;i++){
            for(j=0;j<n;j++){
                if(i&(1<<j)){//第j+1科
                    time[i] = time[i - (1<<j)] + l[j+1].waste;
                    if(dp[i] > dp[i-(1<<j)] + max(0,time[i] - l[j+1].date)){
                        dp[i] = dp[i-(1<<j)] + max(0,time[i] - l[j+1].date);
                        pre[i] = i-(1<<j);book[i] = j+1;
                    }
                }
            }
        }

        printf("%d\n",dp[len-1]);
        stack<int>v;
        i = len - 1;
        while (i != 0)
        {
            v.push(book[i]);
            i = pre[i];
        }
        while (!v.empty())
        {
            int x = v.top();v.pop();
            cout<<l[x].name<<endl;
        }
        
    }
    
    
    return 0;
}