摘要：
题目链接：http://poj.org/problem?id=1011#include#include#include#includeusing namespace std;const int maxn = 100;int a[maxn];int N;int sum;int len,cnt;bool used[maxn];bool cmp(int a,int b){ return a > b;}bool dfs(int u,int curlen,int num){ if(num == cnt) return true; for(int i=u;i>N && N){ 阅读全文
