1.题目描述:点击打开链接
2.解题思路:本题其实等价于找一些数,使得他们的和等于sum/2,猛一看不知道如何下手,其实很简单:从后往前一个个试即可,如果相加后大于sum/2,必然不是这一组的数,由于必然有解,因此这样做最后一定能找到解。
3.代码:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<algorithm>
#include<string>
#include<sstream>
#include<set>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<functional>
using namespace std;
#define maxn 100000+10
typedef long long LL;
int a[maxn], n;
int vis[maxn];
int main()
{
//freopen("test.txt", "r", stdin);
while (scanf("%d", &n)!=EOF && n)
{
memset(vis, -1, sizeof(vis));
LL sum = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
sum += a[i];
}
if (sum & 1){ printf("No\n"); continue; }
puts("Yes");
LL s = 0;
for (int i = n - 1; i >= 0; i--)//注意要从后往前枚举
if ((s + a[i]) * 2 <= sum)
{
s += a[i];
vis[i] = 1;
}
for (int i = 0; i < n; i++)
printf("%d%c", vis[i], i == n - 1 ? '\n' : ' ');
}
return 0;
}