1.安装依赖 yum install gem -y gem install builder   2.安装.配置nginx的文件列表 添加/etc/nginx/default.d/mirrors.conf文件如下内容 location ~ ^/ {         root /home/mirrors/;         autoindex on;         autoindex_exact_size off;         autoindex_localtime on;         #…

/** 2017 ACM/ICPC Asia Regional Shenyang Online 解题报告 题目:hdu6199 gems gems gems 链接:http://acm.hdu.edu.cn/showproblem.php?pid=6199 题意:Alice和Bob从左到右取数字,一开始Alice可以取1个或者2个.之后当前者可以取得数字个数为k或者k+1个. k为上一个人选的数字个数.如果当前者选不到k个或者k+1个,那么游戏结束. 两个人都用最科学的方法取数字.问Alice的…

题意:有n颗石子 两个人轮流拿 如果上一个人拿了x颗 这个人就可以拿x或x+1颗 问先手能获得与后手的价值差最大是多少 题解:看起来是博弈 其实是DP dp[i][j][0/1]表示当前该0/1拿 拿到第i颗上一个人拿了j个 转移就很裸了 因为当前有两种操作拿x个和拿x+1个 要知道哪一个操作更好 需要知道后面的状态 所以就倒着DP 因为爆内存就滚动了  对2^k取% = & 2^k - 1 感觉这样滚动会少个常数 #include <bits/stdc++.h> using name…

作者:jostree 转载请注明出处 http://www.cnblogs.com/jostree/p/4102743.html 题目链接:hdu 4778 Gems Fight! 博弈+状态dp+搜索 不难发现,无论Alice和Bob以何种方式投掷包裹,他们得到的Magic Stones个数的和$Sum$是一定的,因此只需要计算Alice可以获得的最大的Magic Stones的个数MAXA,则Bob获得的个数为Sum-MAXA,而两者的最大的差为MAXA-(sum-MAXA)为答案.那么如何…

题目链接 Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a game with these n gems.They place the gems in a row and decide to take turns to take gems from left to right. Alice goes first and takes 1 or 2 gems…

Gems Fight! Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 1069    Accepted Submission(s): 456 Problem Description Alice and Bob are playing "Gems Fight!": There are Gems of G differen…

gems gems gems Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a game with these n gems.They place the gems in a row and…

gems gems gems Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 895    Accepted Submission(s): 167 Problem Description Now there are n gems, each of which has its own value. Alice and Bob play a…

题目链接:hdu 6169 gems gems gems Now there are n gems, each of which has its own value. Alice and Bob play a game with these n gems. They place the gems in a row and decide to take turns to take gems from left to right. Alice goes first and takes 1 or 2…

题目链接: Hdu 4778 Gems Fight! 题目描述: 就是有G种颜色,B个背包,每个背包有n个宝石,颜色分别为c1,c2............两个人轮流取背包放到公共容器里面,容器里面有s个相同颜色宝石的时候,这s个相同颜色的宝石会融合成一个魔法石.当选手选择一个背包放到公共容器里会产生魔法石,魔法石就归这个选手所有,并且奖励这个选手再选一个背包,直到不再产生魔法石为止.(每个背包只能选取一次)每个选手会尽量使自己得到的魔法石最多,问最后先手减后手的值? 解题思路: 数据范围比较小…