代码

#include <algorithm>
#include <cstdio>
#include <cstring>
#define N 110
#define SYS_MAX 25010
using namespace std;

int T, n, a[N], sys[SYS_MAX], f[SYS_MAX];

int main() {
    //freopen("test.in", "r", stdin);
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d", a + i);
        sort(a + 1, a + n + 1);
        memset(f, 0, sizeof(f));
        memset(sys, 0, sizeof(sys));
        f[a[n] + 1] = 1;
        int pnt = 1, ret = 0;
        for (int i = 1; i <= a[n] + 1; ++i) {
            if (f[i] && i != a[pnt]) {
                sys[++ret] = a[pnt];
                break;
            }
            if (i == a[pnt]) {
                if (!f[i]) f[i] = 1, sys[++ret] = a[pnt];
                ++pnt;
            }
            if (f[i])
                for (int j = 1; j <= ret; ++j)
                    if (sys[j] + i <= a[n])
                        f[sys[j] + i] = 1;
        }
        printf("%d\n", ret);
    }
    return 0;
}

评测结果