Accepted NecklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2938 Accepted Submission(s): 1156
Problem Description
I have N precious stones, and plan to use K of them to make a necklace for my mother, but she won't accept a necklace which is too heavy. Given the value and the weight of each precious stone, please help me find out the most valuable necklace my mother will accept.
Input
The first line of input is the number of cases.
For each case, the first line contains two integers N (N <= 20), the total number of stones, and K (K <= N), the exact number of stones to make a necklace. Then N lines follow, each containing two integers: a (a<=1000), representing the value of each precious stone, and b (b<=1000), its weight. The last line of each case contains an integer W, the maximum weight my mother will accept, W <= 1000.
Output
For each case, output the highest possible value of the necklace.
Sample Input
Sample Output
|
这题需要注意的是,如果不将当前位置传到下一个递归调用中,就会超时,意思是从这个位置开始,不需要搜之前位置的值,因为会造成重复,往后搜是剪枝的一种方法。
#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <string>
#include <string.h>
#include <algorithm>
#include <vector>
using namespace std;
#define M 30
typedef struct{
int value;
int cost;
}Node;
Node f[M];
int w;
int n, k;
int big;
void DFS(int x, int sum, int ans,int pre){
if(x >= k){
if(ans <= w){
if(big < sum){
big = sum;
}
}
return;
}
if(ans > w)
return;
for(int i = pre; i < n; i++){
sum += f[i].value;
ans += f[i].cost;
DFS(x+1,sum,ans,i+1);
sum -= f[i].value;
ans -= f[i].cost;
}
}
int main(){
int t;
scanf("%d",&t);
for(int i = 0; i < t; i++){
big = 0;
scanf("%d%d",&n,&k);
for(int j = 0; j < n; j++){
scanf("%d%d",&f[j].value,&f[j].cost);
}
scanf("%d",&w);
DFS(0,0,0,0);
printf("%d\n",big);
}
return 0;
}