动态规划基础题(第4题): 此累积和非累积和

碎碎念

• 这道题稍有些水，比赛时遇到这种题就开心了。

标签

• 累积和、排序

合集

• 动态规划、累积和、排序

题目地址

C - Exception Handling

• https://atcoder.jp/contests/abc134/tasks/abc134_c?lang=en

问题描述

You are given a sequence of length N: A${}_1$, A${}_2$, …, A${}_N$. For each integer i between 1 and N (inclusive), answer the following question:

• Find the maximum value among the N-1 elements other than Ai_i