2019上海网络赛(J)Stone gameDP背包

最新推荐文章于 2020-03-20 09:46:49 发布

骑马看骆驼a

最新推荐文章于 2020-03-20 09:46:49 发布

阅读量329

点赞数

分类专栏： DP 文章标签： DP 01背包

本文链接：https://blog.csdn.net/Sclong0218/article/details/100995613

版权

DP 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

CSL loves stone games. He has n stones; each has a weight ai. CSL wants to get some stones. The rule is that the pile he gets should have a higher or equal total weight than the rest; however if he removes any stone in the pile he gets, the total weight of the pile he gets will be no higher than the rest. It’s so easy for CSL, because CSL is a talented stone-gamer, who can win almost every stone game! So he wants to know the number of possible plans. The answer may be large, so you should tell CSL the answer modulo 10^9 + 7.

Formerly, you are given a labelled multiset $S={a1,a2,…,an}$ , find the number of subsets of S: $S'=\{a_{i_1}, a_{i_2}, \ldots, a_{i_k} \}$ , such that

$\left(Sum(S') \ge Sum(S-S') \right) \land \left(\forall t \in S', Sum(S') - t \le Sum(S-S') \right)$ .

InputFile

The first line an integer T (1≤T≤10), which is the number of cases.

For each test case, the first line is an integer n(1≤n≤300), which means the number of stones. The second line are n space-separated integers $a_1,a_2,…,a_n$ (1≤ai≤500).

OutputFile

For each case, a line of only one integer t — the number of possible plans. If the answer is too large, please output the answer modulo 10^9 + 7.

样例输入复制

样例输出复制

2
1

样例解释

In example 1, CSL can choose the stone 1 and 2 or stone 1 and 3.

In example 2, CSL can choose the stone 3.

链接：

https://nanti.jisuanke.com/t/41420

题意：

有一堆石头，现在让你选从中选出几个石头，使得选出石头的总和大于等于剩余石头的总和并且从选出的石头中拿出任何一块石头小于等于剩余石头的总和。

思路:

因为从选出的石头中选出如何一块石头，那么我们要拿出最小的一块石头。所以我们可以从大到小排序一下。dp[k]表示选出石头重量为k的方案数，然后就01背包。因为我们的石头是从大到小排的，那么选第i块石头为最小石头并且总重量为k的方案数就是dp[k-a[i]]。

代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10000000;
const int MOD = 1e9+7;
int a[maxn];
int dp[maxn];
bool cmp(int x, int y)
{
    return x > y;
}
int main()
{
    int t;
    scanf("%d", &t);
    while(t--) {
        int n;
        scanf("%d", &n);
        memset(dp, 0, sizeof(dp));
        int sum = 0;
        for(int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            sum += a[i];
        }
        dp[0] = 1;
        int ans = 0;
        sort(a+1, a+1+n, cmp);
        for(int i = 1; i <= n; i++) {
            for(int j = sum; j >= a[i]; j--) {
                dp[j] = (dp[j] + dp[j-a[i]]) % MOD;
                if(j >= sum - j && j - a[i] <= sum - j) {
                    ans = (ans+dp[j-a[i]])%MOD;
                }
            }
        }
        printf("%d\n", ans%MOD);
        
    }
    
    return 0;
}