蓝桥杯 ALGO-1004

1. 暴力解法思路

1. 枚举子集，
2. 寻找除了构成该子集的元素外，是否存在子集，使得两者的和相同
3. 如果存在，将该子集和存入优先队列中
4. 如果优先队列为空，则不存在两个子集使得两子集元素的和相等，否则输出优先队列的队首

2. 代码

#include <iostream>
#include <vector>
#include <map>
#include <queue>
using namespace std;
priority_queue<int> ans;
map<int, int> flag;
void bfs_find(vector<int> &nums, int &n, int sum, int begin, int now, int &k)
{
    for (int i = begin; i < n; ++i)
    {
        if (k == 1)
            return;
        if (flag[i] == 1)
            continue;
        if (now + nums[i] == sum)
        {
            ans.push(now + nums[i]);
            k = 1;
            return;
        }
     bfs_find(nums, n, sum, i + 1, nums[i] + now, k);
    }
    return;
}
void bfs(vector<int> &nums, int &n, int now, int begin)
{
    for (int i = begin; i < n; ++i)
    {
        int k = 0;
        if (flag[i] == 1)
            continue;
        flag[i] = 1;
        bfs_find(nums, n, now + nums[i], 0, 0, k);
        if (flag.find(now + nums[i]) != flag.end())
            ans.push(now + nums[i]);
        bfs(nums, n, now + nums[i], i + 1);
        flag[i] = 0;
    }
    return;
}
int main()
{
    int n;
    cin >> n;
    vector<int> nums(n);
    for (int i = 0; i < n; ++i)
        cin >> nums[i];
    if(ans.empty())
        cout << 0;
    else
        cout << ans.top();
    return 0;
}

2.动态规划

正在学习大佬的解法。学会了接着写。