internet

#include <bits/stdc++.h>
#define MAX 1007
#define INF 1e9 + 7
#define make_pair mp

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

int arr[MAX], dp[MAX][MAX], pre[MAX][MAX], sum[MAX][MAX];
int main(){
    int n; cin >> n;
    for(int i = 1 ; i <= n; i++) cin >> arr[i];

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) {
            pre[i][j] = arr[j]*abs(j-i);
            sum[i][j] += pre[i][j] + sum[i][j-1];
        }
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) cout <<  pre[i][j] << " ";
        cout << endl;
    }
    cout << endl;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) dp[i][j] = INF;
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) cout << sum[i][j] << " ";
        cout << endl;
    }
    cout << endl;
    for(int i = 1; i <= n; i++){
        dp[i][1] = sum[i][n];
        for(int j = 0; j < i; j++){
            for(int k = 2; k <= n; k++){
                dp[i][k] = min(dp[j][k-1]-sum[j][n]+sum[j][j] + sum[j][(j+i)/2]- sum[j][j] + sum[i][n] - sum[i][(j+i+1)/2], dp[i][k]);
            }
        }
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++) cout <<  dp[i][j] << " ";
        cout << endl;
    }
    return 0;
}