Little E's array

题号：NC223764
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

One day little E gets an array of length n, with numbers from left to right subscript ${1}$ to ${n}$ , we named it ${A}$ ,and you can rearrange the array any way you want.

When one of these numbers goes from subscript ${x}$ to subscript ${y}$ , then that number can contribute ${A_{x}*(x-y)*(x-y)}$ points. little E wants to ask you to get the maximum score by rearranging the array of A's in you hand