USACO: A Game

A Game
IOI'96 - Day 1

Consider the following two-player game played with a sequence of N positive integers (2 <= N <= 100) laid onto a game board. Player 1 starts the game. The players move alternately by selecting a number from either the left or the right end of the sequence. That number is then deleted from the board, and its value is added to the score of the player who selected it. A player wins if his sum is greater than his opponents.

Write a program that implements the optimal strategy. The optimal strategy yields maximum points when playing against the "best possible" opponent. Your program must further implement an optimal strategy for player 2.

PROGRAM NAME: game1

INPUT FORMAT

Line 1:	N, the size of the board
Line 2-etc:	N integers in the range (1..200) that are the contents of the game board, from left to right

SAMPLE INPUT (file game1.in)

6
4 7 2 9
5 2

OUTPUT FORMAT

Two space-separated integers on a line: the score of Player 1 followed by the score of Player 2.

SAMPLE OUTPUT (file game1.out)

18 11

 

 

思路：

比较水的一道DP，递推方程如下。

给出数列sq[n]，假设best[i][j]表示剩下第i-j个数字时，当前玩家所能获得的最大分数，那么有：

如果i = j，那么

best[i][j] = sq[i] = sq[j]

否则

best[i][j] = max{ sum(i, j) - best[i + 1][j], sum(i, j) - best[i][j - 1] }

sum(i, j)是第i-j个数字的和。

 /* ID: geterns1 PROG: game1 LANG: C++ */ #include <iostream> #include <fstream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; int n, sq[100], sum[100], best[100][100]; void DP(int i, int j){ if (best[i][j]) return; DP(i + 1, j); DP(i, j - 1); if (best[i + 1][j] < best[i][j - 1]) best[i][j] = sum[j] - sum[i] + sq[i] - best[i + 1][j]; else best[i][j] = sum[j] - sum[i] + sq[i] - best[i][j - 1]; } int main(){ freopen("game1.in", "r", stdin); freopen("game1.out", "w", stdout); scanf("%d", &n); for (int i = 0; i < n; i ++){ scanf("%d", sq + i); if (i) sum[i] = sum[i - 1] + sq[i]; else sum[i] = sq[i]; memset(best[i], 0, n); best[i][i] = sq[i]; } DP(0, n - 1); printf("%d %d/n", best[0][n - 1], sum[n - 1] - best[0][n - 1]); fclose(stdin); fclose(stdout); return 0; }