ural1018

maksyuki 发表于 oj 分类，标签: DP-树形DP

22 9月 2015

1018. Binary Apple Tree

Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enumerate by integers the root of binary apple tree, points of branching and the ends of twigs. This way we may distinguish different branches by their ending points. We will assume that root of tree always is numbered by 1 and all numbers used for enumerating are numbered in range from 1 to N, where N is the total number of all enumerated points. For instance in the picture below N is equal to 5. Here is an example of an enumerated tree with four branches:

InputAs you may know it's not convenient to pick an apples from a tree when there are too much of branches. That's why some of them should be removed from a tree. But you are interested in removing branches in the way of minimal loss of apples. So your are given amounts of apples on a branches and amount of branches that should be preserved. Your task is to determine how many apples can remain on a tree after removing of excessive branches.

First line of input contains two numbers: N and Q (2 ≤ N ≤ 100; 1 ≤ Q ≤ N − 1). N denotes the number of enumerated points in a tree. Q denotes amount of branches that should be preserved. NextN − 1 lines contains descriptions of branches. Each description consists of a three integer numbers divided by spaces. The first two of them define branch by it's ending points. The third number defines the number of apples on this branch. You may assume that no branch contains more than 30000 apples.

Output

Output should contain the only number — amount of apples that can be preserved. And don't forget to preserve tree's root 😉

Sample

input

output

5 21 3 11 4 10

2 3 20

3 5 20

题目类型：树形DP

算法分析：dp[i][j]表示以i为根的子树恰好保留j个分支所具有的最多苹果数量，初始化dp全为0。最后直接输出dp[1][m]即可，其中m为保留的分支的个数。状态转移方程为：dp[u][i] = max (dp[u][i], dp[u][i-k] + dp[v][k-1] + w)，其中v为u的子节点，w为u-v这条边上的苹果数

#pragma comment(linker, "/STACK:102400000,102400000")
#include <set>
#include <bitset>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <vector>
#include <ios>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <utility>
#include <complex>
#include <numeric>
#include <functional>
#include <cmath>
#include <ctime>
#include <climits>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cassert>
using namespace std;

#define CFF freopen ("aaa.txt", "r", stdin)
#define CPPFF ifstream cin ("aaa.txt")
#define LL long long
#define ULL unsigned long long
#define	DB(ccc)	cout << #ccc << " = " << ccc << endl

const int INF = 0x7FFFFFFF;
const int MOD = 1e9 + 7;
const double EPS = 1e-10;
const double PI = 2 * acos (0.0);
const int maxn = 100 + 66;

int dp[maxn][maxn];
bool vis[maxn];
int n, m;

//分别表示顶点v。w和下一个邻接的位置
struct Node
{
    int v, w, next;
};

Node edge[maxn*maxn];
int head[maxn], edgelen;//分别表示顶点的表头节点和边的数量

//将所有的数组均初始化为-1
void Init ()
{
    memset (head, -1, sizeof (head));
    memset (edge, -1, sizeof (edge));
    edgelen = 0;
}

//使用头插法构建
void AddEdge (int u, int v, int w)
{
    edge[edgelen].v = v;
    edge[edgelen].w = w;
    edge[edgelen].next = head[u];
    head[u] = edgelen++;
}

void dfs (int rt)
{
    vis[rt] = true;
    for (int i = head[rt]; i != -1; i = edge[i].next)
    {
        if (vis[edge[i].v])
            continue;

        dfs (edge[i].v);
        for (int j = m; j >= 1; j--)
            for (int k = 1; k <= j; k++)
                dp[rt][j] = max (dp[rt][j], dp[rt][j-k] + dp[edge[i].v][k-1] + edge[i].w);
    }
}

int main()
{
//    CPPFF;
    while (cin >> n >> m)
    {
        int u, v, w;
        Init();
        for (int i = 1; i <= n - 1; i++)
        {
            cin >> u >> v >> w;
            AddEdge (u, v, w);
            AddEdge (v, u, w);
        }

        memset (vis, false, sizeof (vis));
        memset (dp, 0, sizeof (dp));
        dfs (1);
        cout << dp[1][m] << endl;
    }
    return 0;
}

100

101

102

103

104

105

106

107

108

109

#pragma comment(linker, "/STACK:102400000,102400000")

#include <set>

#include <bitset>

#include <list>

#include <map>

#include <stack>

#include <queue>

#include <deque>

#include <string>

#include <vector>

#include <ios>

#include <iostream>

#include <fstream>

#include <sstream>

#include <iomanip>

#include <algorithm>

#include <utility>

#include <complex>

#include <numeric>

#include <functional>

#include <cmath>

#include <ctime>

#include <climits>

#include <cstdarg>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cctype>

#include <cassert>

using namespace std;

#define CFF freopen ("aaa.txt", "r", stdin)

#define CPPFF ifstream cin ("aaa.txt")

#define LL long long

#define ULL unsigned long long

#define DB(ccc) cout << #ccc << " = " << ccc << endl

const int INF = 0x7FFFFFFF;

const int MOD = 1e9 + 7;

const double EPS = 1e-10;

const double PI = 2 * acos (0.0);

const int maxn = 100 + 66;

int dp[maxn][maxn];

bool vis[maxn];

int n, m;

//分别表示顶点v。w和下一个邻接的位置

struct Node

{

int v, w, next;

};

Node edge[maxn*maxn];

int head[maxn], edgelen;//分别表示顶点的表头节点和边的数量

//将所有的数组均初始化为-1

void Init ()

{

memset (head, -1, sizeof (head));

memset (edge, -1, sizeof (edge));

edgelen = 0;

}

//使用头插法构建

void AddEdge (int u, int v, int w)

{

edge[edgelen].v = v;

edge[edgelen].w = w;

edge[edgelen].next = head[u];

head[u] = edgelen++;

}

void dfs (int rt)

{

vis[rt] = true;

for (int i = head[rt]; i != -1; i = edge[i].next)

{

if (vis[edge[i].v])

continue;

dfs (edge[i].v);

for (int j = m; j >= 1; j--)

for (int k = 1; k <= j; k++)

dp[rt][j] = max (dp[rt][j], dp[rt][j-k] + dp[edge[i].v][k-1] + edge[i].w);

}

int main()

{

// CPPFF;

while (cin >> n >> m)

{

int u, v, w;

Init();

for (int i = 1; i <= n - 1; i++)

{

cin >> u >> v >> w;

AddEdge (u, v, w);

AddEdge (v, u, w);

}

memset (vis, false, sizeof (vis));

memset (dp, 0, sizeof (dp));

dfs (1);

cout << dp[1][m] << endl;

}

return 0;

}

poj2063

poj1463

一	二	三	四	五	六	日
« 6月
						1
2	3	4	5	6	7	8
9	10	11	12	13	14	15
16	17	18	19	20	21	22
23	24	25	26	27	28	29
30	31

超客的水墨烟雨

ural1018

1018. Binary Apple Tree

Output

Sample

分类目录

标签云

书签

近期评论