hdu 1561 the more the better (树形DP)
来源:互联网 发布:phpcms建站 编辑:程序博客网 时间:2024/06/05 12:50
题目链接:hdu 1561
就树上乱搞吧~~~
#include<cstdio>#include<cstring>#include<iostream>using namespace std;#define maxn (210)int w[maxn],head[maxn],fa[maxn],dp[maxn][maxn];struct node{int v,next;}e[100000];inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;}int k;void adde(int u,int v){e[k].v=v; e[k].next=head[u]; head[u]=k++;}void find(int u,int cnt){dp[u][1]=w[u];for(int i=head[u];i!=-1;i=e[i].next){int v=e[i].v;if(cnt>1)find(v,cnt-1);for(int j=cnt;j>=1;j--)for(int k=1;k<=j;k++){dp[u][j]=max(dp[u][j],dp[u][k]+dp[v][j-k]);}}}int main(){int N,M;while(N=read()){M=read(); k=0;memset(dp,0,sizeof(dp));memset(head,-1,sizeof(head));for(int i=1;i<=N;i++){int a=read(); w[i]=read();adde(a,i); fa[i]=a;}find(0,M+1);//这里改为M+1可以免去对0的讨论printf("%d\n",dp[0][M+1]);}return 0;}
0 0
- HDOJ (HDU) 1561 The more, The Better (树形DP)
- hdu 1561 The more, The Better(树形DP)
- hdu 1561 The more, The Better(树形DP入门)
- hdu 1561 the more the better (树形DP)
- HDU 1561 The more, The Better(树形dp+背包)
- HDU 1561 The more, The Better(树形DP)
- hdu 1561 The more, The Better(树形DP)
- HDU 1561 The more, The Better(树形DP)
- hdu 1561 The more, The Better(树形DP)
- hdu 1561 The more, The Better(树形dp)
- HDU 1561 The more, The Better (树形DP)
- hdu 1561 The more, The Better (树形DP)
- hdu 1561 The more, The Better 树形DP+背包
- hdu 1561 The more, The Better(树形dp)
- hdu 1561 (树形dp)The more, The Better
- HDU 1561 The more, The Better(树形DP)
- hdu 1561 The more, The Better(树形DP入门)
- hdu 1561 The more, The Better 树形DP入门题
- 死锁的必要条件和解决方法
- leetCode #191 number of 1 bits
- 开篇记(2015.03.10)
- APP中注册时常用的发送验证码的Button,带倒计时重发功能
- LKT4200HS 32位高性能防盗版加密芯片
- hdu 1561 the more the better (树形DP)
- java 实现99乘法表
- 日本とドイツ―国際秩序強化へ協働を
- 浅谈android4.0开发之GridLayout布局
- CentOS下github生成公钥
- 20150310 N1
- 音频、语音信号处理的相关需求(广告)
- TortoiseSVN中Branching和Merging实践
- boost::tokenizer分词器