http://acm.hdu.edu.cn/showproblem.php?pid=1455 int dfs(int all,int sum,int now),all代表剩余总长,sum,代表每段长,now代表当前拼接的长度. if(a[i]+now == sum || now == 0) return 0; while(a[i+1] == a[i]) i++; 这两句话剪枝很重要. #include<iostream> #include<string> #include<c…