- 博客(24)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 BZOJ 1002 轮状病毒
1002: [FJOI2007]轮状病毒Time Limit: 1 Sec Memory Limit: 162 MB[Submit][Status]Description给定n(NInput第一行有1个正整数n。Output将编程计算出的不同的n轮状病毒数输出Sample Input3Sample Output1
2014-11-14 22:01:53
616
原创 BZOJ 1001: 狼抓兔子
1001: [BeiJing2006]狼抓兔子Time Limit: 15 Sec Memory Limit: 162 MBSubmit: 10585 Solved: 2424[Submit][Status]Description现在小朋友们最喜欢的"喜羊羊与灰太狼",话说灰太狼抓羊不到，但抓兔子还是比较在行的，而且现在的兔子还比较笨，它们只有两个窝，现在你做为狼王，面
2014-11-14 21:53:45
517
原创 Vijos P1881 闪烁的繁星
P1882石阶上的砖背景微雨的山门下石阶湿着——只有独立的我和缕缕的游云这也是'同参密藏'么描述清晨, Alice与Bob在石阶上玩砖块.他们每人都有属于自己的一堆砖块.每人的砖块都由N列组成且N是奇数.Alice的第i列砖块有m[i]个.而B
2014-10-27 20:41:32
815
原创 NOIP2011
NOIP2011 DAY1,DAY2 数据，标程，题目，题解合集：http://download.youkuaiyun.com/detail/junjie435/8054741DAY1．题目概况 铺地毯 选择客栈 mayan 游戏 DAY2．题目概况 计算系数 聪明的质监员 观光公交
2014-10-19 09:26:09
1139
原创 Whac-a-Mole(动态规划)
我们把每一秒看成一个状态则当前时间下锤子落在各位置上能打到的最多的地鼠为：能在一秒内移动至该位置的各位置到达该位置时打到的地鼠数量与出发状态时快打到的地鼠数量之和最大值。
2014-10-17 21:47:59
1446
原创 Connect(并查集+暴力判边)
ConnectTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u POJ 2706DescriptionFigure 1Figure 2Figure 3aFigure 3bFigure 4
2014-10-16 20:16:33
749
原创 Snakes（并查集）
SnakesTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uPOJ 2588DescriptionBuffalo Bill wishes to cross a 1000x1000 square field. A number of snakes a
2014-10-16 19:39:26
1096
原创 Radar Installation(贪心)
C - Radar InstallationTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1328DescriptionAssume the coasting is an infinite s
2014-10-16 19:30:42
520
原创 Roadblocks
RoadblocksDescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because s
2014-10-11 07:31:44
426
原创 Frogger
FroggerDescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water
2014-10-10 22:21:16
472
原创 codevs1005 生日礼物
1005 生日礼物 时间限制: 1 s 空间限制: 128000 KB 题目等级 : 黄金 Gold题目描述 Description 9月12日是小松的朋友小寒的生日。小松知道小寒特别喜欢蝴蝶，所以决定折蝴蝶作为给小寒的生日礼物。他来到了PK大学最大的一家地下
2014-10-09 21:53:52
1238
原创 Mega Man’s Missions
Mega Man’s MissionsMega Man is off to save the world again. His objective is to kill the Robots created by Dr. Wily whose motive is to conquer the world. In each mission, he will try to destroy a
2014-10-09 20:42:23
706
原创 Strategic game
Strategic gameBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He mus
2014-10-09 20:38:41
1111
原创 Edge Case
In graph theory, a matching or independent edge set in a graph G = (V; E) is a set of edges M Esuch that no two edges in the matching M share a common vertex.Recently you saw in the news that \T
2014-10-09 20:14:32
850
原创 How do you add?
How do you add?Larry is very bad at math - he usually uses a calculator, which worked well throughout college. Unforunately, he is now struck in a deserted island with his good buddy Ryan after a
2014-10-09 19:47:33
538
原创 Partitioning by Palindromes（回文串-->字符串DP）
Partitioning by PalindromesWe say a sequence of characters is a palindrome if it is the same written forwards and backwards. For example, 'racecar' is a palindrome, but 'fastcar' is not.A partit
2014-10-09 19:41:25
569
原创 Almost Union-Find
Almost Union-FindI hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.The data structure you need to write is also a
2014-10-09 18:03:09
487
原创 Black Box
Black BoxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7592 Accepted: 3121DescriptionOur Black Box represents a primitive database. It can save an int
2014-10-09 17:28:46
631
原创 Jupiter Atacks!
Major cities have been destroyed by Jovian spacecrafts and humanity is fighting back. Nlogonia is spearheading the counter-offensive, by hacking into the spacecrafts' control system.Unlike Earthli
2014-10-09 17:04:08
437
原创 Span
Problem C - Span [Description]给出n个整数xi，Si的计算规则如下： |Ai|表示集合Ai的元素个数例如，X = {40, 2, 10, 50, 30, 15}，那么S = {1, 1, 2, 4, 1, 1} Xi序列是第i个素数（第一个素数为2）对m取模后的值现需要计算出Xi对应的Si的所有元素之和对m取模后的值 [In
2014-10-09 15:48:52
540
NOIP2011数据
2014-10-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人