USACO算法系列二十五——fence8

   题目：http://www.nocow.cn/index.php/Translate:USACO/fence8

   N维的0-1背包问题，我觉得更像是多机调度问题，属于N-P难问题，终于发现什么叫做NP难问题，可以很快的写出它的深度搜索方法，但是对于接下来的剪枝，粗略的做了一些剪枝，而且我是越剪枝时间越长，看来我得统筹的思考一下。

#include <iostream> #include <fstream> #include <algorithm> #define NSIZE 50 #define RSIZE 1023 using namespace std; int n, r; int supplywood[NSIZE]; int needwood[RSIZE]; int result = 0; void fence(int index, int number) { //剪枝 if (number + r - index <= result ) { return; } if (index >= r ) //循环结束 { result = result < number ? number : result; } else { int temp = 0; //裁剪这一块 for(int i = 0; i < n; i ++) { if (supplywood[i] == temp) { continue; } if (supplywood[i] >= needwood[index]) { supplywood[i] -= needwood[index]; fence(index+1, number+1); supplywood[i] += needwood[index]; temp = supplywood[i]; } } //没有裁剪这一块 fence(index +1, number); }//end else } int main() { ifstream fin("fence8.in"); ofstream fout("fence8.out"); //输入数据 fin >> n; for (int i=0; i < n; i ++) { fin >> supplywood[i]; } fin >> r; for ( int i=0; i < r; i ++) { fin >> needwood[i]; } //初始化数据 sort(supplywood, supplywood + n); sort(needwood, needwood + r); //深度搜索 fence(0,0); //输出结果 fout << result << endl; return 0; }

    运行结果如下，在第四个就卡壳了：

Executing... Test 1: TEST OK [0.011 secs, 3020 KB] Test 2: TEST OK [0.011 secs, 3020 KB] Test 3: TEST OK [0.011 secs, 3020 KB] > Run 4: Execution error: Your program (`fence8') used more than the allotted runtime of 1 seconds (it ended or was stopped at 1.674 seconds) when presented with test case 4. It used 3020 KB of memory.