c++——pow_na的博客——[POI2014]PTA-Little Bird

pow_na

已于 2022-12-31 14:39:54 修改

阅读量128

点赞数

分类专栏：题解文章标签： c++

于 2022-12-31 12:57:20 首次发布

本文链接：https://blog.youkuaiyun.com/m0_73557158/article/details/128504499

版权

题解专栏收录该内容

14 篇文章 ¥39.90 ¥99.00

订阅专栏

超级会员免费看

该博客介绍了Byteotian Line Forest中的一只小鸟如何计划从第一棵树飞到最后一棵树的最不疲劳路线。小鸟每次可以飞到最多k棵树远的地方，飞上比当前树高的树会使飞行变得疲劳。博客提供了输入输出格式，数据范围，并给出了一组输入输出样例。

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

题目描述

In the Byteotian Line Forest there are nn trees in a row.

On top of the first one, there is a little bird who would like to fly over to the top of the last tree.

Being in fact very little, the bird might lack the strength to fly there without any stop.

If the bird is sitting on top of the tree no. i, then in a single flight leg it can fly toany of the trees no. i+1,i+2,\cdots,i+ki+1,i+2,⋯,i+k, and then has to rest afterward.

Moreover, flying up is far harder to flying down. A flight leg is tiresome if it ends in a tree at leastas high as the one where is started. Otherwise the flight leg is not tiresome.

The goal is to select the trees on which the little bird will land so that the overall flight is leasttire