C. Vasya And The Mushrooms Educational Codeforces Round 48 (Rated for Div. 2)

brandong

于 2018-08-05 17:29:14 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏：随笔文章标签： codeforces 思维教育专场预处理

本文链接：https://blog.youkuaiyun.com/qq_40160605/article/details/81432788

Vasya 在蘑菇林中寻找最大收获的路径。给定一个2行n列的矩阵，每个单元格代表蘑菇生长速度，从左上角出发，每次移动到相邻单元格，收集当前格子的生长值。目标是遍历所有单元格一次，求最大总重量。通过预处理找到最佳路径，确保最大收益。

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

C. Vasya And The Mushrooms

Educational Codeforces Round 48 (Rated for Div. 2)

C. Vasya And The Mushrooms

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya's house is situated in a forest, and there is a mushroom glade near it. The glade consists of two rows, each of which can be divided into n consecutive cells. For each cell Vasya knows how fast the mushrooms grow in this cell (more formally, how many grams of mushrooms grow in this cell each minute). Vasya spends exactly one minute to move to some adjacent cell. Vasya cannot leave the glade. Two cells are considered adjacent if they share a common side. When Vasya enters some cell, he instantly collects all the mushrooms growing there.

Vasya begins his journey in the le