codeforces859c(dp 博弈)

C. Pie Rules

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You may have heard of the pie rule before. It states that if two people wish to fairly share a slice of pie, one person should cut the slice in half, and the other person should choose who gets which slice. Alice and Bob have many slices of pie, and rather than cutting the slices in half, each individual slice will be eaten by just one person.

The way Alice and Bob decide who eats each slice is as follows. First, the order in which the pies are to be handed out is decided. There is a special token called the "decider" token, initially held by Bob. Until all the pie is handed out, whoever has the decider token will give the next slice of pie to one of the participants, and the decider token to the other participant. They continue until no slices of pie are left.

All of the slices are of excellent quality, so each participant obviously wants to maximize the total amount of pie they get to eat. Assuming both players make their decisions optimally, how much pie will each participant receive?

Input

Input will begin with an integer N (1 ≤ N ≤ 50), the number of slices of pie.

Following this is a line with N integers indicating the sizes of the slices (each between 1 and 100000, inclusive), in the order in which they must be handed out.

Output

Print two integers. First, the sum of the sizes of slices eaten by Alice, then the sum of the sizes of the slices eaten by Bob, assuming both players make their decisions optimally.

Examples

input

3
141 592 653

output

653 733

input

5
10 21 10 21 10

output

31 41

Note

In the first example, Bob takes the size 141 slice for himself and gives the decider token to Alice. Then Alice gives the size 592 slice to Bob and keeps the decider token for herself, so that she can then give the size 653 slice to herself.

题意：n个派，有不同的值，排好顺序，有一个令牌，拿到令牌的人选择接下来这个派是自己吃还是对方吃，如果自己吃，交出令牌，否则留下令牌。里那个人都想在最后获得的值的sum最大，求两个人分别获得的值的sum。

思路：从后向前逆推拥有令牌的人接下来能获得的最大的sum是多少。这样我们就能推得刚开始拿令牌的Bob最后能得到的值sum。

       dp[i]=max(dp[i+1],sum[i+1]-dp[i+1]+a[i]);   //1.选择不吃，留下令牌。2.吃，交出令牌 

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int a[55],sum[55],dp[55];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		memset(a,0,sizeof(a));
		memset(sum,0,sizeof(sum));
		memset(dp,0,sizeof(dp));
		for(int i=0;i<n;i++)
			scanf("%d",&a[i]);
		for(int i=n-1;i>=0;i--)
			sum[i]=sum[i+1]+a[i];
		for(int i=n-1;i>=0;i--)
			dp[i]=max(dp[i+1],sum[i+1]-dp[i+1]+a[i]);   //1.选择不吃，留下令牌。2.吃，交出令牌 
		printf("%d %d\n",sum[0]-dp[0],dp[0]);
	}
}