From 6fa3800c838f6fc8faef76c6ed3ddf8252e6f271 Mon Sep 17 00:00:00 2001
From: p9zok7cfl <2385348640@qq.com>
Date: Fri, 8 Dec 2023 15:12:12 +0800
Subject: [PATCH] =?UTF-8?q?Delete=20'=E5=88=86=E6=94=AF=E9=99=90=E7=95=8C?=
 =?UTF-8?q?=E6=B3=95=E7=AE=97=E6=B3=95=E8=AE=BE=E8=AE=A1.cpp'?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 分支限界法算法设计.cpp | 55 ---------------------------------
 1 file changed, 55 deletions(-)
 delete mode 100644 分支限界法算法设计.cpp

diff --git a/分支限界法算法设计.cpp b/分支限界法算法设计.cpp
deleted file mode 100644
index ac94714..0000000
--- a/分支限界法算法设计.cpp
+++ /dev/null
@@ -1,55 +0,0 @@
-#include <iostream>
-#include <vector>
-#include <queue>
-#include <cmath>
-using namespace std;
-
-const int N = (1 << 20) + 10;
-int n,m;
-int v[N],w[N];
-int res = -1;
-int s[N]; // s[i]�洢���Ǵӵ�1����Ʒ����i����Ʒ�ļ�ֵ�ܺ�
-
-struct good{
-    int idx,c,r,tv; // idx��ʾѡ���±꣬c��ʾ��ѡ���ĵ�ǰ�ܼ�ֵ��r��ʾ��ǰѡ����ʣ���ܼ�ֵ��tv��ʾ��ѡ���ĵ�ǰ�����
-    bool operator > (const good& W) const{
-        return W.c + W.r > c + r;
-    }
-}goods[N];
-
-int bfs(){
-    goods[1] = {1,0,0,0};
-priority_queue<good,vector<good>,greater<good>> q;
-    q.push(goods[1]);
-
-    while(q.size()){
-        auto t = q.top();
-//        cout << t.idx << endl;
-        q.pop();
-        int idx = t.idx << 1;
-        goods[idx] = {idx,goods[t.idx].c,s[n] - s[(int)log2(idx)],goods[t.idx].tv};
-        goods[idx + 1] = {idx + 1,goods[t.idx].c + w[(int)log2(idx)],s[n] - s[(int)log2(idx)],goods[t.idx].tv + v[(int)log2(idx)]};
-        if((int)log2(t.idx) == n) { // �����Ѿ����ӽڵ㣬����´�
-            res = max(res,t.c);
-            continue;
-        }
-
-        if(goods[idx].tv <= m && goods[idx].c + goods[idx].r > res) q.push(goods[idx]); // ���統ǰѡ��������������������������ҵ�ǰ��ֵ+ʣ���ֵ > ��ǰ���Ž⣬��װ�뱳��
-        if(goods[idx + 1].tv <= m && goods[idx + 1].c + goods[idx + 1].r > res) q.push(goods[idx + 1]);
-    }
-
-    return res;
-}
-
-int main(){
-    cin >> n >> m;
-    for(int i = 1; i <= n; i ++) cin >> v[i] >> w[i],s[i] = s[i - 1] + w[i];
-//
-//    for(int i = 2; i < 1 << n + 1; i ++){
-//        goods[i] = {i,goods[i >> 1].c + (i&1)*w[(int)log2(i)],s[n] - s[(int)log2(i)],goods[i >> 1].tv + (i&1)*v[(int)log2(i)]};
-//    }
-//
-//    for(int i = 1; i < 1 << n + 1; i ++) printf("i = %d,c[i] = %d,r[i] = %d,tv[i] = %d\n",goods[i].idx,goods[i].c,goods[i].r,goods[i].tv);
-    cout << bfs() << endl;
-    return 0;
-}