HDU6092 Rikka with Subset(01背包+思路)
来源:互联网 发布:linux设置目录的权限 编辑:程序博客网 时间:2024/06/05 02:53
Rikka with Subset
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 856 Accepted Submission(s): 422
Problem Description
As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them:
Yuta hasn positive A1−An and their sum is m . Then for each subset S of A , Yuta calculates the sum of S .
Now, Yuta has got2n numbers between [0,m] . For each i∈[0,m] , he counts the number of i s he got as Bi .
Yuta shows Rikka the arrayBi and he wants Rikka to restore A1−An .
It is too difficult for Rikka. Can you help her?
Yuta has
Now, Yuta has got
Yuta shows Rikka the array
It is too difficult for Rikka. Can you help her?
Input
The first line contains a number t(1≤t≤70) , the number of the testcases.
For each testcase, the first line contains two numbersn,m(1≤n≤50,1≤m≤104) .
The second line containsm+1 numbers B0−Bm(0≤Bi≤2n) .
For each testcase, the first line contains two numbers
The second line contains
Output
For each testcase, print a single line with n numbers A1−An .
It is guaranteed that there exists at least one solution. And if there are different solutions, print the lexicographic minimum one.
It is guaranteed that there exists at least one solution. And if there are different solutions, print the lexicographic minimum one.
Sample Input
22 31 1 1 13 31 3 3 1
Sample Output
1 21 1 1HintIn the first sample, $A$ is $[1,2]$. $A$ has four subsets $[],[1],[2],[1,2]$ and the sums of each subset are $0,1,2,3$. So $B=[1,1,1,1]$
题意:给出n和m,下面m+1个数为b数列,Bi 代表A序列中的所有子集之和为i的有Bi个,A序列总和为m,n个元素;
分析:在很多个较小数字推较大数字的时候,总是要由小向大推,因为小的数字经过组合会产生新的大的,因此在每求出A序列的一部分的时候,用dp[i]记录一下i这个数字会由前面的A组合出多少次,用B[i]-dp[i]就是需要新增的A的个数,好像没用到n。。。
关键点在于,如何让前面的A组合;看成01背包问题,容量为m的背包去装i,初始值dp[0]=1,由于i不断增大,A子集随机组合不会重复
参考博客:传送门
#include<bits/stdc++.h>#define mem(a,b) memset(a,b,sizeof(a))using namespace std;typedef long long LL;const int maxn=1e4+10;int b[maxn],dp[maxn],a[maxn];int main(){ int t,n,m; scanf("%d",&t); while(t--) { mem(dp,0); mem(a,0); scanf("%d%d",&n,&m); for(int i=0;i<=m;i++) scanf("%d",&b[i]); int tot=0; dp[0]=1; for(int i=1;i<=m;i++) { int tmp=b[i]-dp[i];//还需添加多少个i for(int j=0;j<tmp;j++) { a[tot++]=i; for(int k=m;k>=i;k--) { dp[k]+=dp[k-i]; } } } printf("%d",a[0]); for(int i=1;i<tot;i++) printf(" %d",a[i]); puts(""); }}
阅读全文
0 0
- HDU6092 Rikka with Subset(01背包+思路)
- HDU6092-Rikka with Subset(背包)
- hdu6092 Rikka with Subset (反向背包)
- HDU6092 Rikka with Subset
- HDU6092-Rikka with Subset
- hdu6092 Rikka with Subset
- HDU6092(Rikka with Subset)
- HDU6092-Rikka with Subset
- HDU6092-2017多校5&&背包&贪心-Rikka with Subset
- Rikka with Subset(hdu6092)
- HDU6092 Rikka with Subset【DP】
- HDU6092 Rikka with Subset(01背包,2017 HDU多校联赛 第5场)
- HDU6092 Rikka with Subset-01背包dp-2017多校联盟5 第8题
- 【2017多校】HDU6092 Rikka with Subset 【DP】
- HDU6092 Rikka with Subset[母函数]
- Hdu6092 Rikka with Subset(2017多校第5场) 逆推背包
- Hdu6092 Rikka with Subset(2017多校第5场)
- hdu6092 Rikka with Subset(母函数+思维)
- UVA 11987 Almost Union-Find
- 在win10下安装Tensorflow(CUDA8.0+cuDNN5.1)
- 【HDU 6092 Rikka with Subset】 思维 & 背包
- BST
- Navicat for MySQL Mac 破解版
- HDU6092 Rikka with Subset(01背包+思路)
- VS常见错误之一:error LNK2019: 无法解析的外部符号
- Noip 2014 提高组 解方程
- C++将链表划分为左边小,中间等,右边大于pivotKey的形式
- C++设计模式——Iterator模式
- HDU 2196 树形DP
- 华为机试:称砝码、矩阵乘法
- Pycharm快捷键设置
- Leetcode--655. Print Binary Tree