UVA624 - CD (DFS)

由于题目给出不会超过20个，所以可以直接DFS暴力过

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int MAXN = 20 + 5;
int n, m, Max, O[MAXN], X[MAXN], M[MAXN];
void dfs(int i,int p, int s) {
    if(s > n) return;
    if(s > Max || (s == Max && p > M[0])) {
        memcpy(M + 1, X, p * sizeof(int));
        M[0] = p;
        Max = s;
    }
    if(i >= m || p > 20) {
        return;
    }
    dfs(i + 1, p, s);
    X[p] = O[i];
    dfs(i + 1, p + 1, s + O[i]);
}
int main() {
    while(~scanf("%d%d", &n, &m)) {
        for(int i = 0; i < m; i ++) {
            scanf("%d", &O[i]);
        }
        Max = 0;
        dfs(0,0,0);
        for(int i = 1; i <= M[0]; i ++) {
            printf("%d ", M[i]);
        }
        printf("sum:%d\n", Max);
    }
    return 0;
}