【luoguP1535】【USACO】游荡的奶牛（过河卒dp模型）

最新推荐文章于 2022-06-21 15:46:29 发布

Patrickpwq

最新推荐文章于 2022-06-21 15:46:29 发布

阅读量192

点赞数

文章标签：过河卒模型 DP

本文链接：https://blog.csdn.net/patrickpwq/article/details/79837871

版权

该博客介绍了如何使用过河卒的动态规划模型解决一道编程题，即计算奶牛在限定时间内从草地的一个位置移动到另一个位置的不同路径数量。题目描述了奶牛每秒只能水平或垂直移动，并且需要避开树木。博主通过分析，提出从终点出发反向计算路径数量的策略，并给出了动态规划的初始条件和状态转移方程。

摘要由CSDN通过智能技术生成

题目描述

Searching for the very best grass, the cows are travelling about the pasture which is represented as a grid with N rows and M columns (2 <= N <= 100; 2 <= M <= 100). Keen observer Farmer John has recorded Bessie's position as (R1, C1) at a certain time and then as (R2, C2) exactly T (0 < T <= 15) seconds later. He's not sure if she passed through (R2, C2) before T seconds, but he knows she is there at time T.

FJ wants a program that uses this information to calculate an integer S that is the number of ways a cow can go from (R1, C1) to (R2, C2) exactly in T seconds. Every second, a cow can travel from any position to a vertically or horizontally neighboring position in the pasture each second (no resting for the cows). Of course, the pasture has trees through which no cow can travel.

Given a map with '.'s for open pasture space and '*' for trees, calculate the number of possible ways to travel from (R1, C1) to (R2, C2) in T seconds.

奶牛们在被划分成N行M列(2 <= N <= 100; 2 <= M <= 100)的草地上游走，试图找到整块草地中最美味的牧草。Farmer John在某个时刻看见贝茜在位置 (R1, C1)，恰好T (0 < T <= 15)秒后，FJ又在位置(R2, C2)与贝茜撞了正着。 FJ并不知道在这T秒内贝茜是否曾经到过(R2, C2)，他能确定的只是，现在贝茜在那里。设S为奶牛在T秒内从(R1, C1)走到(R2, C2)所能选择的路径总数，FJ希望有一个程序来帮他计算这个值。每一秒内，奶牛会水平或垂直地移动1单位距离（奶牛总是在移动，不会在某秒内停在它上一秒所在的点）。草地上的某些地方有树，自然，奶牛不能走到树所在的位置，也不会走出草地。现在你拿到了一张整块草地的地形图，其中'.'表示平坦的草地，'*&#