2014鞍山网络预选赛1004(贪心)hdu5000
2014-09-14 00:01
288 查看
Clone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 291 Accepted Submission(s): 131
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
. 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
2 1 5 2 8 6
Sample Output
1 7
题意:RT
思路:找到一个x,然后求满足总和等于x的所有的解
而x要取T[i]总和的一半,比赛的时候只能想到要取x为T[i]的最大值,sad~
而求n个数(对应的位置不能超过T数组的上界)满足总和等于x的所有的解就是一个背包问题,dp搞就可以了
相关文章推荐
- 2014鞍山网络预选赛1010(缩点+高斯消元)hdu5006
- 2014鞍山网络预选赛1006(LCT模板题)hdu5002
- 2014鞍山网络预选赛1005(概率DP)hdu5001
- hdu 5037 Galaxy 2014鞍山区域赛D(最小方差 贪心 想法)
- 2014西安网络预选赛1002(后缀数组求第K大的子串)hdu5008
- 2014上海网络赛1004||hdu5045 二分图的最佳匹配 或 状态压缩dp
- Rotate+hud+2014鞍山网络赛
- hdu5000 Clone 鞍山网络赛D题
- HDU 5045 Contest(概率dp,状态压缩,2014上海网络赛1004)
- 2014上海网络预选赛1011(LCT)HDU5052
- hdu 5001 Walk 2014鞍山网络赛E 矩阵快速幂
- 2014西安网络预选赛1009(点分治)HDU5016
- 2014 ACM/ICPC 鞍山赛区网络赛(清华命题)
- LCT link-cut tree Hdu 5002 Tree 2014鞍山网络赛
- 2013杭州网络预选赛 1004 Save Labman No.004 求异面直线之间距离
- 2014鞍山网络赛 E题||hdu 5001 概率dp
- ZOJ 3818 The Himalayas (2014 ACM/ICPC 牡丹江站 网络预选赛 J 题)
- 2016ACM-ICPC沈阳网络预选赛1004 Mathematician QSC
- 2014 ACM-ICPC亚洲区域赛牡丹江站网络预选赛 C Untrusted Patrol
- 2013杭州网络预选赛 1004 Save Labman No.004 求异面直线之间距离