HDU1074 Doing Homework

状态压缩DP，被字典序坑了10几分钟。。。。。。。

#include<iostream>
#include<cstdio>
using namespace std;
const int INF=1<<29;
struct Sub
{
    char na[105];
    int t, ed;
} sub[16];
struct DP
{
    int sc, alt;
} dp[600005];
int path[600005], p[600005], gg[21];
void init()
{
    int i, k=0;
    for(i=1; i<600000; i*=2)
    {
        p[i]=k++;
    }
}
int main()
{
    int T, n, i, j, num, tmp, xx, now;
    scanf("%d",&T);
    init();
    while(T--)
    {
        scanf("%d",&n);
        for(i=0; i<n; i++)
            scanf("%s%d%d",sub[i].na,&sub[i].ed,&sub[i].t);
        dp[0].alt=dp[0].sc=0;
        path[0]=-1;
        num=1<<n;
        for(i=1; i<num; i++)
        {
            dp[i].sc=INF;
            for(j=i; j>0; j-=j&(-j))
            {
                tmp=j&(-j);
                xx=p[tmp];
                if(dp[i^tmp].alt+sub[xx].t>sub[xx].ed)
                    now=dp[i^tmp].alt+sub[xx].t-sub[xx].ed;
                else now=0;
                if(dp[i].sc>=dp[i^tmp].sc+now)
                {
                    dp[i].sc=dp[i^tmp].sc+now;
                    dp[i].alt=dp[i^tmp].alt+sub[xx].t;
                    path[i]=xx;
                }
            }
        }
        printf("%d\n",dp[num-1].sc);
        int ss=0;
        for(i=num-1;path[i]>=0;i=(1<<path[i])^i)
        {
            gg[ss++]=path[i];
        }
        for(i=ss-1;i>=0;i--)
        {
            printf("%s\n",sub[gg[i]].na);
        }
    }
    return 0;
}