以下是引用BlueGuy在2010-12-22 12:45:53的发言：

你那题目太偏了， 你搞个 "我今年多大？"， 我一样答不出来，/
是你狗屎还是题目狗屎？

以下是引用无尽苍穹在2010-12-22 12:46:58的发言：

呵呵 要注册啊..可以直接把原题发上来么

You have been given a list of jewelry items that must be split amongst two people: Frank and Bob. Frank likes very expensive jewelry. Bob doesn't care how expensive the jewelry is, as long as he gets a lot of jewelry. Based on these criteria you have devised the following policy:
1) Each piece of jewelry given to Frank must be valued greater than or equal to each piece of jewelry given to Bob. In other words, Frank's least expensive piece of jewelry must be valued greater than or equal to Bob's most expensive piece of jewelry.
2) The total value of the jewelry given to Frank must exactly equal the total value of the jewelry given to Bob.
3) There can be pieces of jewelry given to neither Bob nor Frank.
4) Frank and Bob must each get at least 1 piece of jewelry.
Given the value of each piece, you will determine the number of different ways you can allocate the jewelry to Bob and Frank following the above policy. For example:
    values = {1,2,5,3,4,5}
Valid allocations are:
  Bob               Frank
  1,2                 3
  1,3                 4
  1,4                 5  (first 5)
  1,4                  5  (second 5)
  2,3                  5  (first 5)
  2,3                  5  (second 5)
   5  (first 5)         5  (second 5)
   5  (second 5)     5  (first 5)
1,2,3,4               5,5
Note that each '5' is a different piece of jewelry and needs to be accounted for separately. There are 9 legal ways of allocating the jewelry to Bob and Frank given the policy, so your method would return 9.
 
Definition
        
Class:    Jewelry
Method:    howMany
Parameters:    int[]
Returns:    long
Method signature:    long howMany(int[] values)
(be sure your method is public)
   
 
Constraints
-    values will contain between 2 and 30 elements inclusive.
-    Each element of values will be between 1 and 1000 inclusive.
 
Examples
0)   
        
{1,2,5,3,4,5}
Returns: 9
From above.
1)   
        
{1000,1000,1000,1000,1000,
 1000,1000,1000,1000,1000,
 1000,1000,1000,1000,1000,
 1000,1000,1000,1000,1000,
 1000,1000,1000,1000,1000,
 1000,1000,1000,1000,1000}
Returns: 18252025766940
2)   
        
{1,2,3,4,5}
Returns: 4
Valid allocations:
Bob               Frank
1,2                 3
2,3                 5
1,3                 4
1,4                 5
3)   
        
{7,7,8,9,10,11,1,2,2,3,4,5,6}
Returns: 607
4)   
        
{123,217,661,678,796,964,54,111,417,526,917,923}
Returns: 0

以下是引用Devil_W在2010-12-22 12:47:36的发言：

 
 
 
我简直无语。。。 你太犀利了。。。就一道简单的DP 你就说题目太偏了。。。

以下是引用Devil_W在2010-12-22 11:27:44的发言：

 
 
谁怕谁？
 
 
代码你可以从这里去拿，
 
刚好有个lib没写结束，实现NAT穿越。