1004 To Buy or Not to Buy - Hard Version (35分)
题目传送门:1004 To Buy or Not to Buy - Hard Version (35分)
一、题目大意
二、解题思路
dfs判断是否选取这一个
三、AC代码
#include<bits/stdc++.h>
using namespace std;
const int N = 110, C=130, MAX = 999999;
string t;
int n;
int exceed = MAX;
int M1[C], M3[C], EX[C];
int M2[N][C];
void dfs(int step, int ex){
if(ex >= exceed)return;// 提前剪枝
if(step>=n){
for