1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
| #include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
template <class T> inline void write(const T x) {
if(x<0) return (void) (putchar('-'),write(-x));
if(x>9) write(x/10);
putchar(x%10^48);
}
ll n,a[109];
__int128 cf[109],s[109],cfs[109],dp[109][109];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;++i)cin>>a[i];
for(int i=1;i<n;++i)cf[i]=a[i+1]-a[i];
for(int i=1;i<n;++i)s[i]=s[i-1]+cf[i],cfs[i]=cfs[i-1]+cf[i]*cf[i];
for(int i=1;i<n;++i){
for(int j=1;j<=i;++j){
for(int k=0;i-k>=j;++k){
dp[i][j]=max(dp[i][j],dp[i-k-1][j-1]+(s[i]-s[i-k-1])*(s[i]-s[i-k-1]));
}
}
}
for(int i=1;i<=n;++i){
write(dp[n-1][max(n-1-2*i,1ll)]),putchar('\n');;
}
return 0;
}
|