matrixfun

 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;
__int128 read()
{
  __int128 x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}
void print(__int128 x)
{
  if(x < 0)
    {
      putchar('-');
      x = -x;
    }
  if(x > 9)
    {
      print(x / 10);
    }
  putchar(x % 10 + '0');
}
__int128 dp[1001][1001], two[1001], m;
void Two() {
	for (__int128 i = 1; i <= m + 2; i++)
    {
		two[i] = two[i - 1] * 2;
	}
}
__int128 a[1001], ans;
int main()
{
  __int128 a[1001], n;
  n = 1;
  m = read();
  two[0]=1;
  Two();
  for(__int128 it = 1;it <= n;it++)
    {
      memset(dp, 0, sizeof(dp));
      for(__int128 i = 1;i <= m;i++)
	{
	  a[i] = read();
	}
      for(__int128 i = 1;i <= m;i++)
	{
	  for(__int128 j = m;j >= i;j--)
	    {
	      dp[i][j] = max(dp[i][j], dp[i - 1][j] + two[m - j + i - 1] * a[i - 1]);
	      dp[i][j] = max(dp[i][j], dp[i][j + 1] + two[m - j + i - 1] * a[j + 1]);
	    }
	}
      __int128 maxx;
      for(__int128 i = 1;i <= m;i++)
	{
	  maxx = max(maxx, dp[i][i] + two[m] * a[i]);
	}
      ans += maxx;
    }
  print(ans);
  return 0;
}