hdu-5000 Clone(dp)

最新推荐文章于 2020-02-08 19:32:15 发布

转载最新推荐文章于 2020-02-08 19:32:15 发布 · 133 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/zhangchengc919/p/5407620.html

本文探讨了一种基于超级克隆能力的算法问题，通过动态规划求解在特定条件下能够存活的最大克隆数量。问题中定义了每个克隆体拥有的多种能力值，并规定若某一克隆体的所有能力值都不低于另一克隆体，则后者无法生存。

题目链接：

Clone

Time Limit: 2000/1000 MS (Java/Others)

Memory Limit: 65536/65536 K (Java/Others)

Problem Description

After eating food from Chernobyl, DRD got a super power: he could clone himself right now! He used this power for several times. He found out that this power was not as perfect as he wanted. For example, some of the cloned objects were tall, while some were short; some of them were fat, and some were thin.

More evidence showed that for two clones A and B, if A was no worse than B in all fields, then B could not survive. More specifically, DRD used a vector v to represent each of his clones. The vector v has n dimensions, representing a clone having N abilities. For the i-th dimension, v[i] is an integer between 0 and T[i], where 0 is the worst and T[i] is the best. For two clones A and B, whose corresponding vectors were p and q, if for 1 <= i <= N, p[i] >= q[i], then B could not survive.

Now, as DRD's friend, ATM wants to know how many clones can survive at most.

Input

The first line contains an integer T, denoting the number of the test cases.

For each test case: The first line contains 1 integer N, 1 <= N <= 2000. The second line contains N integers indicating T[1], T[2], ..., T[N]. It guarantees that the sum of T[i] in each test case is no more than 2000 and 1 <= T[i].

Output

For each test case, output an integer representing the answer MOD 10^9 + 7.

Sample Input

8 6

Sample Output

题意：

思路：

dp[i][j]表示前j个人和为i的方案数;

dp[i+k][j]=∑dp[i][j-1](0<=k<=a[j]);

结果为dp[sum/2][n],真是谜一样的答案;

sum=∑t[i];

AC代码:

#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
typedef long long ll;
const ll mod=1e9+7;
int t,n,a[2005];
ll dp[4005][2003];
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        int sum=0,ans=0;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            ans+=a[i];
        }
        memset(dp,0,sizeof(dp));
        for(int i=0;i<=a[1];i++)
        {
            dp[i][1]=1;
        }
        for(int i=1;i<=n;i++)
        {
            sum+=a[i];
            for(int j=0;j<=a[i];j++)
            {
                for(int k=0;k<=sum;k++)
                {
                    dp[k+j][i]+=dp[k][i-1]%mod;
                    dp[k+j][i]%=mod;
                }
            }
        }
        printf("%lld\n",dp[ans/2][n]);
    }
    return 0;
}

转载于:https://www.cnblogs.com/zhangchengc919/p/5407620.html