Educational Codeforces Round 39 (Rated for Div. 2)

最新推荐文章于 2021-05-01 22:32:34 发布

努力过

最新推荐文章于 2021-05-01 22:32:34 发布

阅读量246

点赞数

分类专栏： ACM--基础 codeforces

本文链接：https://blog.csdn.net/hello_sheep/article/details/79952104

版权

给定一个整数序列，你需要将其分成两个子序列，求这两个子序列之和的最大差值。你需要实现一个算法来解决这个问题并给出具体示例的解释。

摘要由CSDN通过智能技术生成

You are given a sequence a consisting of n integers. You may partition this sequence into two sequences b and c in such a way that every element belongs exactly to one of these sequences.

Let B be the sum of elements belonging to b, and C be the sum of elements belonging to c (if some of these sequences is empty, then its sum is 0). What is the maximum possible value of B - C?

Input

The first line contains one integer n (1 ≤ n ≤ 100) — the number of elements in a.

The second line contains n integers a₁, a₂, ..., a_n ( - 100 ≤ a_i ≤ 100) — the elements of sequence a.