//
// main.cpp
// yybhjbl
//
// Created by liuzhe on 17/10/21.
// Copyright © 2017年 liuzhe. All rights reserved.
//
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <list>
#include <bitset>
#include <stack>
#include <stdlib.h>
#define lowbit(x) (x&-x)
#define e exp(1.0)
#define eps 1e-8
//ios::sync_with_stdio(false);
// auto start = clock();
// cout << (clock()-start)/(double)CLOCKS_PER_SEC<<endl;
typedef long long ll;
typedef long long LL;
using namespace std;
typedef unsigned long long ull;
const int maxn=100;
int n;
double c;//容量
double cv;//current value
double cw;//current weight
double bestp;//current best solution
struct node
{
int id;//index
double v,w;
int
0/1背包(回溯法求解)-算法设计与分析
最新推荐文章于 2023-01-06 12:28:59 发布