• HDU_1011_Starship Troopers_树型dp


    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1011

    Starship Troopers

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 16276    Accepted Submission(s): 4335


    Problem Description
    You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each room is occupied by some bugs, and their brains hide in some of the rooms. Scientists have just developed a new weapon and want to experiment it on some brains. Your task is to destroy the whole base, and capture as many brains as possible.

    To kill all the bugs is always easier than to capture their brains. A map is drawn for you, with all the rooms marked by the amount of bugs inside, and the possibility of containing a brain. The cavern's structure is like a tree in such a way that there is one unique path leading to each room from the entrance. To finish the battle as soon as possible, you do not want to wait for the troopers to clear a room before advancing to the next one, instead you have to leave some troopers at each room passed to fight all the bugs inside. The troopers never re-enter a room where they have visited before.

    A starship trooper can fight against 20 bugs. Since you do not have enough troopers, you can only take some of the rooms and let the nerve gas do the rest of the job. At the mean time, you should maximize the possibility of capturing a brain. To simplify the problem, just maximize the sum of all the possibilities of containing brains for the taken rooms. Making such a plan is a difficult job. You need the help of a computer.
     
    Input
    The input contains several test cases. The first line of each test case contains two integers N (0 < N <= 100) and M (0 <= M <= 100), which are the number of rooms in the cavern and the number of starship troopers you have, respectively. The following N lines give the description of the rooms. Each line contains two non-negative integers -- the amount of bugs inside and the possibility of containing a brain, respectively. The next N - 1 lines give the description of tunnels. Each tunnel is described by two integers, which are the indices of the two rooms it connects. Rooms are numbered from 1 and room 1 is the entrance to the cavern.

    The last test case is followed by two -1's.
     
    Output
    For each test case, print on a single line the maximum sum of all the possibilities of containing brains for the taken rooms.
     
    Sample Input
    5 10 50 10 40 10 40 20 65 30 70 30 1 2 1 3 2 4 2 5 1 1 20 7 -1 -1
     
    Sample Output
    50 7
     
    第二道树型dp,之前想用搜索做。最后看了题解。思路还是能够理解。
    注意:树是无向的(双向)。当troop为0时不能再得到head(坑)。
    树型dp还需继续理解,继续做题。
    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<vector>
    #include<cstring>
    using namespace std;
    
    int n,m;
    int cost[105],value[105];
    int dp[105][105];
    int father[105];
    vector<int> v[105];
    bool vis[105];
    
    void tree_dp(int root)
    {
        int fcost=cost[root];
        vis[root]=1;
        for(int i=fcost;i<=m;i++)
            dp[root][i]=value[root];
        for(int i=0;i<v[root].size();i++)
        {
            int son=v[root][i];
            if(vis[son])
                continue;
            tree_dp(son);
            for(int j=m;j>=fcost;j--)
            {
                for(int k=1;k<=j-fcost;k++)
                    dp[root][j]=max(dp[root][j],dp[root][j-k]+dp[son][k]);
            }
        }
    }
    
    int main()
    {
        while(scanf("%d%d",&n,&m)!=EOF&&(m!=-1&&n!=-1))
        {
            memset(vis,0,sizeof(vis));
            //memset(father,0,sizeof(father));
            memset(dp,0,sizeof(dp));
            for(int i=0;i<=n;i++)
                v[i].clear();
            for(int i=1; i<=n; i++)
            {
                int co;
                scanf("%d%d",&co,&value[i]);
                cost[i]=co/20;
                if(co%20>0)
                    cost[i]++;
                //cout<<cost[i]<<'*'<<endl;
            }
            for(int i=1;i<n;i++)
            {
                int a,b;
                scanf("%d%d",&a,&b);
                v[a].push_back(b);
                v[b].push_back(a);
                //father[b]++;
            }
            if(m==0) {printf("0
    ");continue;}
            tree_dp(1);
            printf("%d
    ",dp[1][m]);
        }
        return 0;
    }
     
  • 相关阅读:
    MySQL数据库:数据完整性及约束的应用
    MySQL数据库:运算符
    MySQL数据库:合并结果集
    MySQL数据库:聚合函数的使用
    spring web mvc环境搭建
    golang中type常用用法
    有些事情,你真的要早点明白
    一个小事例,了解golang通道阻塞模式
    golang中,slice的几个易混淆点
    作为面试官的一点小感想
  • 原文地址:https://www.cnblogs.com/jasonlixuetao/p/5443910.html
Copyright © 2020-2023  润新知