zoukankan      html  css  js  c++  java
  • hdu1074

    #include <iostream>
    #include <string>
    #include <cstring>
    #include <stack>
    #include <algorithm>
    using namespace std;

    const int inf = 1<<30;

    struct node
    {
    string name;
    int dead,cost;
    } a[50];

    struct kode
    {
    int time,score,pre,now;
    } dp[1<<15];

    int main()
    {
    int t,i,j,s,n,end;
    cin >> t;
    while(t--)
    {
    memset(dp,0,sizeof(dp));
    cin >> n;
    for(i = 0; i<n; i++)
    cin >> a[i].name >> a[i].dead >> a[i].cost;
    end = 1<<n;
    for(s = 1; s<end; s++)
    {
    dp[s].score = inf;
    for(i = n-1; i>=0; i--)
    {
    int tem = 1<<i;
    if(s & tem)
    {
    int past = s-tem;
    int st = dp[past].time+a[i].cost-a[i].dead;
    if(st<0)
    st = 0;
    if(st+dp[past].score<dp[s].score)
    {
    dp[s].score = st+dp[past].score;
    dp[s].now = i;
    dp[s].pre = past;
    dp[s].time = dp[past].time+a[i].cost;
    }
    }
    }
    }
    stack<int> S;
    int tem = end-1;
    cout << dp[tem].score << endl;
    while(tem)
    {
    S.push(dp[tem].now);
    tem = dp[tem].pre;
    }
    while(!S.empty())
    {
    cout << a[S.top()].name << endl;
    S.pop();
    }
    }

    return 0;
    }

  • 相关阅读:
    bzoj1415 NOI2005聪聪和可可
    Tyvj1952 Easy
    poj2096 Collecting Bugs
    COGS 1489玩纸牌
    COGS1487 麻球繁衍
    cf 261B.Maxim and Restaurant
    cf 223B.Two Strings
    cf 609E.Minimum spanning tree for each edge
    cf 187B.AlgoRace
    cf 760B.Frodo and pillows
  • 原文地址:https://www.cnblogs.com/wangkun1993/p/6337669.html
Copyright © 2011-2022 走看看