小坏蛋_千千

I was caught in a heavy rain!

CCCC L3-013. 非常弹的球 (高中物理)

刚上高一的森森为了学好物理,买了一个“非常弹”的球。虽然说是非常弹的球,其实也就是一般的弹力球而已。森森玩了一会儿弹力球后突然想到,假如他在地上用力弹球,球最远能弹到多远去呢?他不太会,你能帮他解决吗?当然为了刚学习物理的森森,我们对环境做一些简化: 假设森森是一个质点,以森森为原点设立...

2017-03-29 19:01:47

阅读数:366

评论数:0

POJ 1185 炮兵阵地 (状压DP)

Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用”H” 表示),也可能是平原(用”P”表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范...

2017-03-28 21:01:49

阅读数:352

评论数:0

HDU 4886 TIANKENG’s restaurant(Ⅱ) (哈希)

Problem Description After improving the marketing strategy, TIANKENG has made a fortune and he is going to step into the status of TuHao. Neverthel...

2017-03-19 11:13:33

阅读数:306

评论数:0

POJ 2029 Get Many Persimmon Trees (枚举)

Description Seiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order...

2017-03-17 20:04:09

阅读数:300

评论数:0

POJ 3280 Cheapest Palindrome (区间DP)

Description Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow a...

2017-03-17 17:50:59

阅读数:413

评论数:0

POJ 1054 The Troublesome Frog (枚举+优化)

Description In Korea, the naughtiness of the cheonggaeguri, a small frog, is legendary. This is a well-deserved reputation, because the frogs jump ...

2017-03-16 17:41:31

阅读数:314

评论数:0

POJ 1191 棋盘分割 (记忆化搜索)

Description 将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行) 原棋盘上每一格有一个分值,一块矩形棋...

2017-03-14 16:20:42

阅读数:294

评论数:0

POJ 3422 Kaka's Matrix Travels (最小费用流)

Description On an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix travels with SUM = 0. For each travel, Kaka move...

2017-03-14 11:16:11

阅读数:284

评论数:0

POJ 2195 Going Home (最小费用最大流)

Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ...

2017-03-13 19:21:38

阅读数:301

评论数:0

HDU 4908 BestCoder Sequence (哈希)

Problem Description Mr Potato is a coder. Mr Potato is the BestCoder. One night, an amazing sequence appeared in his dream. Length of thi...

2017-03-12 21:21:38

阅读数:347

评论数:0

HDU 4907 Task schedule (技巧)

Problem Description 有一台机器,并且给你这台机器的工作表,工作表上有n个任务,机器在ti时间执行第i个任务,1秒即可完成1个任务。 有m个询问,每个询问有一个数字q,表示如果在q时间有一个工作表之外的任务请求,请计算何时这个任务才能被执行。 机器总是按照...

2017-03-12 21:07:08

阅读数:319

评论数:0

HDU 4884 TIANKENG’s rice shop (模拟)

Problem Description TIANKENG managers a pan fried rice shop. There are n kinds of fried rice numbered 1-n. TIANKENG will spend t time for once fryi...

2017-03-12 20:44:09

阅读数:387

评论数:0

HDU 4883 TIANKENG’s restaurant (最大覆盖数)

Problem Description TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its d...

2017-03-12 19:52:45

阅读数:216

评论数:0

HDU 4858 项目管理 (简单图+暴力)

Problem Description 我们建造了一个大项目!这个项目有n个节点,用很多边连接起来,并且这个项目是连通的! 两个节点间可能有多条边,不过一条边的两端必然是不同的节点。 每个节点都有一个能量值。 现在我们要编写一个项目管理软件,这个软件呢有两个操作:...

2017-03-12 19:35:31

阅读数:279

评论数:0

HDU 4857 逃生 (拓扑排序)

Problem Description 糟糕的事情发生啦,现在大家都忙着逃命。但是逃命的通道很窄,大家只能排成一行。 现在有n个人,从1标号到n。同时有一些奇怪的约束条件,每个都形如:a必须在b之前。 同时,社会是不平等的,这些人有的穷有的富。1号最富,2号第二富,以此类推...

2017-03-12 19:23:11

阅读数:490

评论数:0

POJ 2516 Minimum Cost (最小费用最大流)

Description Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1...

2017-03-11 20:19:09

阅读数:276

评论数:0

论中英文写作思维与算法的关系

图论真是一个好东西,现实中很多事物都可以用它来描述,我们的思维也一样,平平常常的事情中也会有着很深的算法。

2017-03-10 18:07:27

阅读数:308

评论数:0

POJ 1364 King (差分约束)

Description Once, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ”If my child was a son and if only he wa...

2017-03-09 21:10:29

阅读数:290

评论数:0

POJ 3159 Candies (差分约束)

Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class...

2017-03-09 18:25:24

阅读数:252

评论数:0

POJ 3096 Surprising Strings (枚举)

Description The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of...

2017-03-08 12:52:43

阅读数:403

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭