p.MsoNormal { margin: 0pt; margin-bottom: .0001pt; text-align: justify; font-family: Calibri; font-size: 10.5000pt }
h1 { margin-top: 5.0000pt; margin-bottom: 5.0000pt; text-align: center; font-family: 宋体; color: rgb(26,92,200); font-weight: bold; font-size: 24.0000pt }
span.10 { font-family: "Times New Roman" }
span.15 { font-family: "Times New Roman"; color: rgb(26,92,200) }
span.16 { font-family: "Times New Roman"; color: rgb(26,92,200) }
p.pre { margin: 0pt; margin-bottom: .0001pt; text-align: left; font-family: 宋体; font-size: 12.0000pt }
span.msoIns { text-decoration: underline; color: blue }
span.msoDel { text-decoration: line-through; color: red }
table.MsoNormalTable { font-family: "Times New Roman"; font-size: 10.0000pt }
div.Section0 { }
HDU 5616 Jam‘s balance（Jam的天平）
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Problem Description - 题目描述
Jim has a balance and N weights. (1≤N≤20)
The balance can only tell whether things on different side are the same weight.
Weights can be put on left side or right side arbitrarily.
Please tell whether the balance can measure an object of weight M.
Jim 有一个天平和N块砝码。(1≤N≤20) 使用天平只能得知两端质量是否相等。 砝码可以放置在左右任意一端。 判断天平能否测量质量为M的物体。
CN
Input - 输入
The first line is a integer T(1≤T≤5), means T test cases.
For each test case :
The first line is N, means the number of weights.
The second line are N number, i‘th number wi(1≤wi≤100)means the i‘th weight‘s weight is wi.
The third line is a number M. M is the weight of the object being measured.
第一行有一个整数T(1≤T≤5)，表示测试用例数。 对于每组测试用例： 第一行为N，表示砝码数。 第二行有N个数，第i个数wi(1≤wi≤100)表示 第三行有一个整数M。M为待测物体质量。
CN
Output - 输出
You should output the "YES"or"NO".
输出"YES"or"NO"。
CN
Sample Input - 输入样例
1 2 1 4 3 2 4 5
Sample Output - 输出样例
NO YES YES
Hint - 提示
For the Case 1:Put the 4 weight alone
For the Case 2:Put the 4 weight and 1 weight on both side
例子1：一端放置4 例子2：放置4和1在同一端
CN
题解
DP水题，先算+，再算-，没了。
代码 C++
1 #include <cstdio>
2 #include <cstring>
3 #define MX 1500
4 bool dp[MX];
5 int main() {
6 int t, n, i, j, data[25];
7 scanf("%d", &t);
8 while (t--) {
9 scanf("%d", &n);
10 for (i = 0; i < n; ++i) scanf("%d", data + i);
11 memset(dp, 0, sizeof dp); dp[0] = 1;
12 for (i = 0; i < n; ++i) {
13 for (j = MX; ~j; --j) if (dp[j]) dp[j + data[i]] = 1;
14 }
15 for (i = 0; i < n; ++i) {
16 for (j = data[i]; j < MX; ++j) if (dp[j]) dp[j - data[i]] = 1;
17 }
18 scanf("%d", &n);
19 for (i = 0; i < n; ++i) {
20 scanf("%d", &j);
21 dp[j] ? puts("YES") : puts("NO");
22 }
23 }
24 return 0;
25 }
HDU 5616 Jam's balance（Jam的天平）