过山车 - Problem

#7826. 过山车

Statistics

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

新游乐园的开发者们想要建造一个“过山车”游乐设施。他们认为，人们在乘坐该设施时，相邻路段之间的高度差越大，体验就越刺激。然而，采购部门已经购买了 $N$ 根支柱，且已知它们的高度。请帮助游乐园的开发者们将这些支柱排成一行，使得所有相邻支柱之间的高度差之和最大（高度差定义为两根相邻支柱高度差的绝对值）。

输入格式

第一行包含一个整数 $N$（$2 \leqslant N \leqslant 10^5$），表示支柱的数量。下一行包含 $N$ 个由空格分隔的非负整数，每个数不超过 $10^8$，表示已购买支柱的高度。

输出格式

输出一个非负整数，表示高度差之和的最大值。

样例

样例输入 1

4
10 20 1 1000

样例输出 1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0