HDU 1074 Doing Homework

看了网上代码也算是AC了。。。

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<math.h>
#include<string>
#include<set>
#include<queue>
#include<map>
typedef long long LL;  
using namespace std;  
#define INF 0x7fffffff
const int MAX=(1<<15)+10;  
int n;  
int dp[MAX],t[MAX],pre[MAX],dea[20],fin[20];
char s[20][110];  
  
void output(int x){  
    if(!x)return;  
    output(x-(1<<pre[x]));  
    printf("%s\n",s[pre[x]]);  
}  
  
int main(){  
	//freopen("G://test.txt","r",stdin);
    int T;  
    scanf("%d",&T);  
    while(T--){  
        scanf("%d",&n);  
        for(int i=0;i<n;++i)scanf("%s%d%d",&s[i],&dea[i],&fin[i]);  
        int bit=1<<n;  
        for(int i=1;i<bit;++i){  
            dp[i]=INF;
            for(int j=n-1;j>=0;--j){
				int temp=1<<j;
				if((temp&i)==0)
					continue;
				int fenshu=t[i-temp]+fin[j]-dea[j];
				if(fenshu<=0)
					fenshu=0;
				if(dp[i]>dp[i-temp]+fenshu){
					dp[i]=dp[i-temp]+fenshu;
					t[i]=t[i-temp]+fin[j];
					pre[i]=j;
				}
            }  
        }  
        printf("%d\n",dp[bit-1]);  
        output(bit-1);
    }                              
    return 0;  
}