这个例子：
10 5
 3  8
15  8
11  8
 7  8
 1  8
17  8
 8  8
 2  8
13  8
 3  8
可以输出1：
Jury #1
Best jury has value 40 for prosecution and value 40 for defence:
 4 5 6 8 9
也可以输出2：
Jury #1
Best jury has value 40 for prosecution and value 40 for defence:
 1 2 6 8 10
因为：
根据输出1：
7+1+17+2+13=45 8+8+8+8+8=40
|D（J）-P（J）|=|40-45|=5
|D（J）+P（J）|=|40+45|=45
根据输出2：
3+5+17+2+3=45 8+8+8+8+8=40
|D（J）-P（J）|=|40-45|=5
|D（J）+P（J）|=|40+45|=45
所以说，两个答案都可以！！！
For an optimal jury J , the value |D(J) - P(J)| must be minimal. If there are several jurys with minimal |D(J) - P(J)|, one which maximizes D(J) + P(J) should be selected since the jury should be as ideal as possible for both parties.
several jurys with minimal |D(J) - P(J)|时，要满足maximizes D(J) + P(J) should be selected，但如果此时还是several呢？？？？？！！！！
数据中，第一个答案是错的，第二个答案是对的！！！我就是卡在这里了！！！！！
气死我啦！！！

• Re:终于刷到0ms了。。。。这题边界好麻烦啊。。贴AC代码 (21) 87541488 2010-08-17 22:32:51
  • Re:终于刷到0ms了。。。。这题边界好麻烦啊。。贴AC代码 (41) forthebreeze 2010-11-09 23:05:35