CodeForces

Pie Rules

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.

Example
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.

题意：两个人在吃派，谁有指挥权就可以把下一块派指派个一个人，那么指挥权就回到另一个人手里。

思路：参考http://blog.csdn.net/xiaoxiede_wo/article/details/78489353

    #include<bits/stdc++.h>      #define ll long long      #define inf 0x3f3f3f3f      using namespace std;      const int MAXN = 100010;      int val[55], dp[55], sum[55];      int main()      {          int n;          cin >> n;          for(int i = 1; i <= n; i++)              cin >> val[i];          for(int i = n; i >= 1; i--)          {              sum[i] = sum[i + 1] + val[i];              dp[i] = max(dp[i + 1], sum[i + 1] - dp[i + 1] + val[i]);          }          cout << sum[1] - dp[1] << " " << dp[1];          return 0;      }