hdu-1074-Doing Homework

状态压缩dp..

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
using namespace std;

#define inf 0x3f3f3f3f
struct node
{
	int d,c;
	char ch[110];
}p[20];
int n;
bool cmp(node a,node b)
{
	return strcmp(a.ch,b.ch)<=0;
}
struct nod
{
	int val,time,f;
}dp[1<<15];
void print(int x,int j)
{
	int t,i;
	if(x==0)
	{
		for(i=0;i<n;i++)
			if((j>>i)&1){
				t=i;
				break;
			}
		cout<<p[i].ch<<endl;
		return ;
	}
	print(dp[x].f,x);
	for(i=0;i<n;i++)
	{
		if(((x>>i)&1)!=((j>>i)&1))
		{
			t=i;
			break;
		}
	}
	cout<<p[i].ch<<endl;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int i,j,k;
		cin>>n;
		for(i=0;i<n;i++)
			cin>>p[i].ch>>p[i].d>>p[i].c;
		sort(p,p+n,cmp);
		for(i=0;i<(1<<n);i++)
		{
			dp[i].f=-1;
			dp[i].time=0;
			dp[i].val=inf;
		}
		dp[0].val=0;
		for(i=0;i<(1<<n);i++)
		{
			for(j=0;j<n;j++)
			{
				if(i&(1<<j)) continue;
				int h=i+(1<<j);
				dp[h].time=dp[i].time+p[j].c;
				if(dp[h].val>dp[i].val+max(dp[h].time-p[j].d,0))
				{
					dp[h].val=dp[i].val+max(dp[h].time-p[j].d,0);
					dp[h].f=i;
				}
			}
		}
		cout<<dp[(1<<n)-1].val<<endl;
		print(dp[(1<<n)-1].f,(1<<n)-1);
	}
}