世界在身后，观我背影辽阔

#include #define maxn 10001using namespace std;int sum[maxn << 2];int order, x, y;void build(int t, int l, int r) { int m = (l + r) >> 1; if (l == r) scanf("%d", sum + t); else {

Problem 1：Balanced PartitionYou have a set, A = {a1,···, an},  of n integers. Partition these integers into two subsets such that you minimize |S1 − S2|, where S1 and S2 denote the sums of the eleme