/*************************************************************************
> File Name: VectorSplit.cpp
> Author: Shaojie Kang
> Mail: kangshaojie@ict.ac.cn
> Created Time: 2015年09月11日 星期五 11时22分27秒
> Problem:
vector contains 2*n elements, split the vector into two vectors which contians n elements,
and the sum of each vector is approximattly sum(2*n)/2
> Solution: Dynamic Programming
Step 1: data structure definition;
Step 2: key condition is: dp[j-1][s] is not null, then dp[j][s+nums[i]] contains dp[j-1][s] and nums[i]
************************************************************************/
#include<iostream>
#include<vector>
using namespace std;
vector<int> arraySplit(const vector<int> nums)
{
int sum = 0;
int size = nums.size();
for(int i = 0; i < size; ++i)
sum += nums[i];
sum >>= 1;
vector<vector<int> > sumVector(sum + 1, vector<int>());
vector<vector<vector<int> > > dp(size, sumVector);
for(int k = 0; k < 2*size; ++k)
{
int i = min(k, size-1);
for(int j = i; j > 0; --j)
{
for(int s = 0; s <= sum; ++s)
{
if(dp[j-1][s].size() == 0) continue;
int value = s + nums[i];
if(value > sum) continue;
if(dp[j][value].size() == 0)
{
dp[j][value].insert(dp[j][value].begin(), dp[j-1][s].begin(), dp[j-1][s].end());
dp[j][value].push_back(nums[i]);
}
}
}
if(dp[0][nums[i]].size() == 0)
dp[0][nums[i]].push_back(nums[i]);
}
int n = (size >> 1);
for(int s = sum; s >= 0; --s)
{
if(dp[n-1][s].size() > 0)
return dp[n-1][s];
}
return vector<int>();
}
int main()
{
int arr[] = {
1, 3, 2, 5, 2, 2
};
vector<int> nums(arr, arr + sizeof(arr)/sizeof(int));
vector<int> result = arraySplit(nums);
for(int i = 0; i < result.size(); ++i)
cout<<result[i]<<" ";
cout<<endl;
return 0;
}
「动态规划」三维DP
最新推荐文章于 2024-07-24 23:08:35 发布