poj 1011 Sticks
来源:互联网 发布:php九大接口编程 编辑:程序博客网 时间:2024/06/07 11:34
Description
George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were originally. Please help him and design a program which computes the smallest possible original length of those sticks. All lengths expressed in units are integers greater than zero.
Input
The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.
Output
The output should contains the smallest possible length of original sticks, one per line.
Sample Input
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0
Sample Output
6
5
Source
Central Europe 1995
**声明:引自“依然的博客”地址:http://blog.sina.com.cn/acmstart
对于原有的代码有所修改,因为提交到poj上AC不了。。。但是不得不说,原作者的代码习惯真的很好!!!**
比较经典的题目,重点在于dfs剪枝的设计。具体的实现:求出总长度sum和小棒最长的长度max,则原棒可能的长度必在max~sum之间,然后从小到大枚举max~sum之间能被sum整除的长度len,用dfs求出所有的小棒能否拼凑成这个长度,如果可以,第一个len就是答案。
下面就是关键的了,就是这道题dfs的实现和剪枝的设计:
1.以一个小棒为开头,用dfs看看能否把这个小棒拼凑成len长,如果可以,用vis[i]记录下用过的小棒,然后继续以另外一个小棒为开头,以此类推。
2.小棒的长度从大到小排序,这个就不解释了。
3.如果当前最长的小棒不能拼成len长,那么就返回前一步,更改前一步的最长小棒的组合情况(这里不能是全部退出),不用再继续搜索下去了。
4.最重要的,就是比如说17,9,9,9,9,8,8,5,2……如果当前最长小棒为17,它与第一个9组合之后dfs发现不能拼成len,那么17就不用和后面所有的9组合了,而直接和8开始组合。
/*Problem: 1011 User: sarukaMemory: 360K Time: 0MSLanguage: G++ Result: Accepted*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 65;int n, len;int stick[maxn];bool flag;bool vis[maxn];bool cmp(int a, int b){ return a > b;}void dfs(int dep, int now_len, int u){ // dep为当前已被用过的小棒数,u为当前要处理的小棒。 if(flag) return; if(now_len == 0) { // 当前长度为0,寻找下一个当前最长小棒。 int k = 0; while(vis[k]) k++; // 寻找第一个当前最长小棒。 vis[k] = true; dfs(dep + 1, stick[k], k + 1); vis[k] = false; return; } if(now_len == len) { // 当前长度为len,即又拼凑成了一根原棒。 if(dep == n) flag = true; // 完成的标志:所有的n根小棒都有拼到了。 else dfs(dep, 0, 0); return; } for(int i = u; i < n; i ++) { if(!vis[i] && now_len + stick[i] <= len) { if(!vis[i-1] && stick[i] == stick[i-1]) continue; // 不重复搜索:最重要的剪枝。 vis[i] = true; dfs(dep + 1, now_len + stick[i], i + 1); vis[i] = false; } } }int main(){ while(scanf("%d", &n) && n != 0) { int sum = 0; flag = false; for(int i = 0; i < n; i ++) { scanf("%d", &stick[i]); sum += stick[i]; } sort(stick, stick + n, cmp); // 从大到小排序。 for(len = stick[0]; len < sum; len ++) { if(sum % len == 0) { // 枚举能被sum整除的长度。 memset(vis, 0, sizeof(vis)); dfs(0, 0, 0); if(flag) break; } } printf("%d\n", len); } return 0;}
Powered By Saruka.
Copyright © 2016 All Rights Reserved.
- poj 1011-sticks
- POJ 1011 Sticks
- poj 1011 Sticks
- poj 1011 Sticks
- POJ 1011 Sticks
- poj 1011 Sticks
- POJ 1011 Sticks
- poj 1011 sticks
- POJ 1011 Sticks
- poj 1011 sticks
- POJ 1011 Sticks
- POJ 1011: Sticks
- poj 1011 Sticks
- poj 1011 Sticks【dfs】
- hdu1455 poj 1011 sticks
- poj 1011 Sticks
- POJ 1011 Sticks
- POJ 1011 Sticks
- 比特同步和帧同步的区别
- 【POJ3393】Lucky and Good Months by Gregorian Calendar
- hdu 5878 I Count Two Three 丑数 二分
- EL表达式
- tp 学习基础
- poj 1011 Sticks
- HDU 2047 - 阿牛的EOF牛肉串(递推)
- [OICamp 2016 Day 1][JZOJ4773]凸包
- C++实现数据结构-队列
- 初识bitset
- hdu5894 hannnnah_j’s Biological Test
- centos6.5环境Redis下载及编译安装
- AngularJS 1.x 和TypeScript(ES6)开发的最佳实践
- IOS手机浏览器无法获取网站视频与音乐,安卓与电脑都可以