# POJ 1185 炮兵阵地 （状压DP）

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

# 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...

# 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...

# 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...

# 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 ...

# POJ 1191 棋盘分割 （记忆化搜索）

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

# 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...

# 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 ...

# 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...

# HDU 4907 Task schedule （技巧）

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

# 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...

# 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...

# HDU 4858 项目管理 （简单图+暴力）

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

# HDU 4857 逃生 （拓扑排序）

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

# 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...

# 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...

# 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...

# 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...

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2006
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23959
最新评论