2017 Multi-University Training Contest
来源:互联网 发布:omp算法 matlab 编辑:程序博客网 时间:2024/05/22 08:16
题目:
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 numbert(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 withn 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]$
题意:给你一个B数组,共m+1个数,求A数组。B[i] 代表A序列中的所有子集之和为i的有B[i]个,A序列总和为m,共n个元素。
思路:大的数都是由很多个小的数组成,从小到大枚举 i
code:
#include<bits/stdc++.h>using namespace std;__int64 a[10005],b[10005],dp[10005]; //dp[i]表示加和为i的子集个数int main(){ int t,n,m,i,j,k; scanf("%d",&t); while(t--){ scanf("%d%d",&n,&m); for(i=0;i<=m;i++) scanf("%I64d",&b[i]); memset(dp,0,sizeof(dp)); k=1;dp[0]=1; //初始化值 for(i=1;i<=m;i++){ int t=b[i]-dp[i]; //A序列中值为i的个数=和为i的子集个数-已经凑到的和为i的个数 while(t--){ a[k++]=i; for(j=m;j>=i;j--) dp[j]+=dp[j-i]; //和为j的子集个数相加更新B序列 } } for(i=1;i<=n;i++) printf("%I64d%c",a[i],i==n?'\n':' '); } return 0;}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- CSS3选择器——属性选择器
- 最大上升子序列长度
- 邻接矩阵 转 网络图
- Android 常见的内存泄露
- 交换2个数
- 2017 Multi-University Training Contest
- spring boot请求乱码----tomcat导致乱码
- list集合根据条件删除元素
- LoadRunner学习中遇到的问题汇总
- 模拟实现库函数strcpy
- 微信接口开发-初级体验
- Druid数据库加密
- Caffe学习:pycaffe利用caffemodel进行分类(2)
- 二进制中开头的第一个数字0表示正整数,1表示负整数吗?