打卡信奥刷题（231）用Scratch图形化工具信奥P9367[普及组][ICPC2022 Xi‘an R] Strange Sum

[ICPC2022 Xi’an R] Strange Sum

题目描述

Given a sequence $a_1,a_2,\dots ,a_n$.

You are going to select zero or more elements of $a$ so that: if you select $a_i$, then in any interval of length $i$ (formally, in $a[j,j+i-1]$ for any $1\le j\le n-i+1$) you can select at most $2$ elements.

Calculate the maximal sum of the elements you select.

输入格式

The first line contains an integer $n$ ($2\le n\le 10^5$).

The second line contains $n$ integers $a_1,a_2,\dots ,a_n$ ($-10^9\le a_i\le 10^9$).

输出格式

Output a single integer denoting the answer.

样例 #1

样例输入 #1

4
1 4 3 2

样例输出 #1

7

样例 #2

样例输入 #2

3
-10 -10 -10

样例输出 #2

0

提示

Source: The 2022 ICPC Asia Xi’an Regional Contest Problem J.

Author: JohnVictor.

Scratch实现

后续

接下来我会不断用scratch来实现信奥比赛中的算法题、Scratch考级编程题实现、白名单赛事考题实现，感兴趣的请关注，我后续将继续分享相关内容