本文介绍了Tanya在Berland城市旅行的计划。她选择一个起点，并按递增顺序访问城市，每个相邻城市间的美丽值差必须相等。任务是帮助Tanya规划旅程，使其总美丽值最大。输入包含城市数量和每个城市的美丽值，输出是最大可能的美丽值。给出了几个示例以说明如何确定最佳旅程。
链接：https://codeforces.ml/contest/1321/problem/B
Tanya wants to go on a journey across the cities of Berland. There are nn cities situated along the main railroad line of Berland, and these cities are numbered from 11 to nn.
Tanya plans her journey as follows. First of all, she will choose some city c1c1 to start her journey. She will visit it, and after that go to some other city c2>c1c2>c1, then to some other city c3>c2c3>c2, and so on, until she chooses to end her journey in some city ck>ck−1ck>ck−1. So, the sequence of visited cities [c1,c2,…,ck][c1,c2,…,ck] should be strictly increasing.
There are some additional constraints on the sequence of cities Tanya visits. Each city ii has a beauty value bibi associated with it. If there is only one city in Tanya's journey, these beauty values imply no additional constraints. But if there are multiple cities in t
最低0.47元/天 解锁文章
273
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
