bzoj1646[Usaco2007 Open]Catch That Cow 抓住那只牛 题意: 数轴上,起点在n,终点在k,每次走可以向左走一步或向右走一步或瞬移到当前坐标的两倍位置,问最少走几次。0≤n,k≤100000。 题解: bfs,允许走的位置边界为[0,max(n,k)+1]。下界为0 ...
分类:
其他好文 时间:
2016-08-03 14:53:29
阅读次数:
172
题目链接:http://poj.org/problem?id=3278 题意: 在一个数轴上(0 ~ 100000),给你农夫J的位置N,和牛cow的位置K,农夫有三种移动的方式:左移一步(X - 1,X为当前位置);右移一步(X + 1);右移2*X步(2 * X);问农夫最少移动多少步可以追赶到 ...
分类:
其他好文 时间:
2016-08-03 13:38:14
阅读次数:
165
题目大意 给出一个序列,求一个连续的子序列的异或和最大. 题解 先探究一下异或的性质. 1.可逆性: A XOR B XOR B = A; 2.满足结合律: (A XOR B) XOR C = A XOR (B XOR C); 利用以上两个性质有助于我们解题. 假设有一序列 A1,A2,A3.... ...
分类:
其他好文 时间:
2016-08-02 21:09:16
阅读次数:
208
Diamond Collector 题目描述 Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected N d ...
分类:
其他好文 时间:
2016-07-30 10:21:25
阅读次数:
201
问题 I: Diamond Collector 题目描述 Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collect ...
分类:
其他好文 时间:
2016-07-30 00:24:35
阅读次数:
161
本题链接 : http://poj.org/problem?id=3268 题目大意:牛们要去聚会,输入N = 顶点数(牛场);M = 边(路)的数目; X = 终点 (聚会点)。问题:求来回时间的最大值。 Input: Line 1: Three space-separated integers, ...
分类:
其他好文 时间:
2016-07-28 15:47:10
阅读次数:
177
Description FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as mu ...
分类:
其他好文 时间:
2016-07-24 20:53:52
阅读次数:
209
Description FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as mu ...
分类:
其他好文 时间:
2016-07-22 21:08:12
阅读次数:
130
Description FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as mu ...
分类:
其他好文 时间:
2016-07-21 23:29:09
阅读次数:
275
Distance Statistics Description Frustrated at the number of distance queries required to find a reasonable route for his cow marathon, FJ decides to a ...
分类:
其他好文 时间:
2016-07-21 21:40:37
阅读次数:
169