【HDU 6092 Rikka with Subset】 思维 & 背包

Rikka with Subset

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 846 Accepted Submission(s): 418

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 has n positive A1−An and their sum is m. Then for each subset S of A, Yuta calculates the sum of S.

Now, Yuta has got 2n numbers between [0,m]. For each i∈[0,m], he counts the number of is he got as Bi.

Yuta shows Rikka the array Bi and he wants Rikka to restore A1−An.

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 numbers n,m(1≤n≤50,1≤m≤104).

The second line contains m+1 numbers B0−Bm(0≤Bi≤2n).

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.

Sample Input
2
2 3
1 1 1 1
3 3
1 3 3 1

Sample Output
1 2
1 1 1
Hint

In 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,确定 n 个数的集合，使得这集合的子集满足和为 0，1，2….m 的个数分别为 b[i]个~

思路 ：n 比较小可以从 n 入手，每确定一个数 l，便在 b[i] 的集合中减去 l 的贡献，即 b[i] - b[i - l]，依次确定 n 个数即可 O(n * m)

AC代码：

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX = 1e4 + 10;
typedef long long LL;
LL a[MAX];
int n,m,T;
void solve(){
    int l = 1;
    while(n--){
        for(int i = l; i <= m; i++)
            if(a[i]){
                l = i; break;
            }
        printf("%d",l);
        if(!n) printf("\n");
        else printf(" ");
        for(int i = l; i <= m; i++) a[i] -= a[i - l]; // 减去 l 可以组成的组合数
    }
}
int main()
{
    scanf("%d",&T);
    while(T--){
        scanf("%d %d",&n,&m);
        for(int i = 0; i <= m; i++) scanf("%lld",&a[i]);
        solve();
    }
    return 0;
}