洛谷 P3004 [USACO10DEC]宝箱Treasure Chest
来源:互联网 发布:python编程工具下载 编辑:程序博客网 时间:2024/05/17 02:03
题目描述
Bessie and Bonnie have found a treasure chest full of marvelous gold coins! Being cows, though, they can't just walk into a store and buy stuff, so instead they decide to have some fun with the coins.
The N (1 <= N <= 5,000) coins, each with some value C_i (1 <= C_i <= 5,000) are placed in a straight line. Bessie and Bonnie take turns, and for each cow's turn, she takes exactly one coin off of either the left end or the right end of the line. The game ends when there are no coins left.
Bessie and Bonnie are each trying to get as much wealth as possible for themselves. Bessie goes first. Help her figure out the maximum value she can win, assuming that both cows play optimally.
Consider a game in which four coins are lined up with these values:
30 25 10 35
Consider this game sequence:
Bessie Bonnie New Coin
Player Side CoinValue Total Total Line
Bessie Right 35 35 0 30 25 10
Bonnie Left 30 35 30 25 10
Bessie Left 25 60 30 10
Bonnie Right 10 60 40 --
This is the best game Bessie can play.
贝西和伯尼找到了一个装满了金币的宝箱!但是,作为奶牛,他们不能随便进入一家商店去买东西。所以他们决定去用这些金币玩一个游戏。
这里有N(1<=N<=5000)个硬币,每个都有一个价值C_i(1<=C_i<=5000)。这些硬币被摆成了一行。贝西和伯尼每人一回合。到了一只奶牛的回合时,他就要拿走最左边或者最右边的硬币。当没有硬币时,游戏结束。
贝西和伯尼都想要使自己拿到的金币价值尽量高,贝西先拿。现在贝西想要你帮帮她,算出她最多可以拿多少钱(伯尼也会尽量取到最优)。
输入输出格式
输入格式:Line 1: A single integer: N
- Lines 2..N+1: Line i+1 contains a single integer: C_i
- Line 1: A single integer, which is the greatest total value Bessie can win if both cows play optimally.
输入输出样例
输入样例#1:
4 30 25 10 35
输出样例#1:
60
#include<algorithm>#include<iostream>#include<cstdio>using namespace std;const int N=5005;int n,c[N],s[N],f[N][N];int main(){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&c[i]);s[i]=s[i-1]+c[i];f[i][i]=c[i];}for(int i=2;i<=n;i++)//长度 for(int j=1;j<=n-i+1;j++)//起点 f[j][i+j-1]=max(f[j][i+j-1],s[i+j-1]-s[j-1]-min(f[j+1][i+j-1],f[j][i+j-2]));printf("%d\n",f[1][n]);return 0;}
- 洛谷 P3004 [USACO10DEC]宝箱Treasure Chest
- Usaco2010 Dec Treasure Chest
- hdu4901Zombie’s Treasure Chest
- Usaco2010 Dec Treasure Chest
- uva12325(Zombie's Treasure Chest/宝箱)=>多种方式枚举
- HDU4091 Zombie’s Treasure Chest
- hdu4091 Zombie’s Treasure Chest
- UVa12325 - Zombie's Treasure Chest
- 12325 Zombie's Treasure Chest
- 12325 - Zombie's Treasure Chest.
- 12325 - Zombie's Treasure Chest
- Zombie's Treasure Chest UVA
- Zombie's Treasure Chest UVA
- 例题7-11 宝箱(Zombie's Treasure Chest, Shanghai 2011, UVa12325)
- HDU 4091--Zombie’s Treasure Chest
- hdu 4091 Zombie’s Treasure Chest
- HDU 4091 - Zombie’s Treasure Chest
- UVA 12325 Zombie's Treasure Chest
- 第四节Node编程语言的基本语法(二)
- 欢迎使用CSDN-markdown编辑器
- java多线程的使用
- 算法-字符串匹配之KMP
- 操作系统一
- 洛谷 P3004 [USACO10DEC]宝箱Treasure Chest
- android开发开源宝贝
- ROS中launch启动文件的理解
- Scrapy研究探索(四)——中文输出与中文保存
- 深入理解Android的startservice和bindservice
- 07 JavaScript基础之--数组案例(下)
- 输入一个链表,从尾到头打印链表每个节点的值。
- android异常Unable to instantiate activity ComponentInfo解决方法
- android主流框架整合