codeforces 555c 数据结构(map 的使用)

最新推荐文章于 2020-12-13 18:45:51 发布

screamin

最新推荐文章于 2020-12-13 18:45:51 发布

阅读量3.1k

点赞数 4

CC 4.0 BY-SA版权

分类专栏：数据结构文章标签：数据结构

本文链接：https://blog.youkuaiyun.com/screamin/article/details/51105919

该博客介绍了如何解决Codeforces上的555C问题，即在一块n*n的巧克力中，从特定位置开始按照指定方向（上或左）吃掉巧克力，求每次能吃掉多少块。博主分析了问题的关键在于找到从每个点开始能吃到的最远位置，利用Map存储已知位置的信息，并给出了解决方案的代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Case of Chocolate

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Andrewid the Android is a galaxy-known detective. Now he does not investigate any case and is eating chocolate out of boredom.

A bar of chocolate can be presented as an n × n table, where each cell represents one piece of chocolate. The columns of the table are numbered from 1 to n from left to right and the rows are numbered from top to bottom. Let's call the anti-diagonal to be a diagonal that goes the lower left corner to the upper right corner of the table. First Andrewid eats all the pieces lying below the anti-diagonal. Then he performs the following q actions with the remaining triangular part: first, he chooses a piece on the anti-diagonal and either direction 'up' or 'left', and then he begins to eat all the pieces starting from the selected cell, moving in the selected direction until