uva 1614——UVA 1614 - Hell on the Markets

最新推荐文章于 2021-05-08 22:50:11 发布

原创最新推荐文章于 2021-05-08 22:50:11 发布 · 592 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#入门经典 #第8章高效算法 #贪心法

UVA 专栏收录该内容

120 篇文章

订阅专栏

探讨了金融危机后仅存两家银行如何通过限定交易量和种类逐步恢复金融市场运作的问题，并提出了一种确保交易平衡的方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Most financial institutions had become insolvent during financial crisis and went bankrupt or were bought by larger institutions, usually by banks. By the end of financial crisis of all the financial institutions only two banks still continue to operate. Financial markets had remained closed throughout the crisis and now regulators are gradually opening them. To prevent speculation and to gradually ramp up trading they will initially allow trading in only one financial instrument and the volume of trading will be limited to i contracts for i -th minute of market operation. Two banks had decided to cooperate with the government to kick-start the market operation. The boards of directors had agreed on trading volume for each minute of this first trading session. One bank will be buying a_i contracts ( 1 $\le$ a_i $\le$ i ) during i -th minute ( 1 $\le$ i $\le$ n ), while the other one will be selling. They do not really care whether to buy or to sell, and the outside observer will only see the volume a_i of contracts traded per minute. However, they do not want to take any extra risk and want to have no position in the contract by the end of the trading session. Thus, if we define b_i = 1 when the first bank is buying and b_i = - 1 when the second one is buying (and the first one is selling), then the requirement for the trading session is that $\sum_{{i=1}}^{{n}}$ a_ib_i = 0 . Your lucky team of three still works in the data center (due to the crisis, banks now share the data center and its personnel) and your task is to find such b_i or to report that this is impossible.

Input

The input file contains several test cases, each of them as described below. The first line of the input contains the single integer number n ( 1 $\le$ n $\le$ 100 000 ). The second line of the input contains n integer numbers -- a_i ( 1 $\le$ a_i $\le$ i ).

Output

For each test case, the first line of the output must contain `` Yes'' if the trading session with specified volumes is possible and `` No'' otherwise. In the former option a second line must contain n numbers -- b_i .

Sample Input

Sample Output

No
Yes
1 -1 -1 1

题意： 给定一个长度为n的序列a，满足1<=ai<=i(很关键的条件），要求确定每个数的正负号，使得最后的和为0.没有这样的策略则输出No。

思路：贪心。因为1<=ai<=i，那么很容易得到的一个结论就是当所有数的绝对值得和为奇数时，一定没有方法使最后的和为0.当为偶数时，一定会存在一种方法。那么选取的时候必定是正1为sum的一半，-1为sum的一半，在遍历时不断贪心找到为+1的那一半即可。

code：#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int INF=0x3fffffff;
const int inf=-INF;
const int N=100005;
const int M=20005;
const int mod=1000000007;
const double esp=1e-4;
const double pi=acos(-1.0);

#define cls(x,c) memset(x,c,sizeof(x))
#define cpy(x,a) memcpy(x,a,sizeof(a))
#define fr(i,s,n) for (int i=s;i<=n;i++)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt  rt<<1
#define rrt  rt<<1|1
#define middle int m=(r+l)>>1
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define mk make_pair
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);

int v[N],s[N];
int main()
{
	int n;
	while (~scanf("%d",&n)&&n)
	{
		ll sum=0;
		fr(i,1,n) scanf("%d",&v[i]),sum+=v[i];
		
		if (sum&1) {puts("No");continue;}
		ll p=0;
		for (int i=n;i>0;i--)
		{
			if ((p+v[i])*2<=sum)p+=v[i],s[i]=1;  //所有的为+1的那一半
			else s[i]=-1;
		}
		puts("Yes");
		fr(i,1,n) printf("%d ",s[i]);
		puts("");
	}
}