[USACO13JAN]画栅栏Painting the Fence 洛谷p2205

最新推荐文章于 2022-10-27 23:15:55 发布

MrTinTin

最新推荐文章于 2022-10-27 23:15:55 发布

阅读量462

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/mrtintin/article/details/83538047

版权

该博客介绍了USACO竞赛中的一道题目，农民John利用奶牛Bessie来涂色围墙。Bessie根据一系列左右移动的指令进行涂色，任务是找出至少被涂上K层颜色的栅栏段数量。题目给出了输入输出格式和样例，并提供了相关竞赛链接和讨论区。

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

题目描述

Farmer John has devised a brilliant method to paint the long fence next to his barn (think of the fence as a one-dimensional number line). He simply attaches a paint brush to his favorite cow Bessie, and then retires to drink a cold glass of water as Bessie walks back and forth across the fence, applying paint to any segment of the fence that she walks past.

Bessie starts at position 0 on the fence and follows a sequence of N moves (1 <= N <= 100,000). Example moves might be "10 L", meaning Bessie moves 10 units to the left, or "15 R", meaning Bessie moves 15 units to the right. Given a list of all of Bessie's moves, FJ would like to know what area of the fence gets painted with at least K coats of paint. Bessie will move at most 1,000,000,000 units away from the origin during her walk.

Farmer John 想出了一个给牛棚旁的长围墙涂色的好方法。（为了简单起见，我们把围墙看做一维的数轴，每一个单位长度代表一块栅栏）他只是简单的把刷子蘸满颜料，系在他最喜欢的奶牛Bessie上&#