#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 107;
int n,sum[maxn],input[maxn],d[maxn][maxn],vis[maxn][maxn];
int dp(int l,int r) {
if (vis[l][r]) return d[l][r];
vis[l][r] = 1;
int m = 0;
for (int i = l + 1; i <= r; i++) m = min(m, dp(i, r));
for (int i = l; i < r; i++) m = min(m, dp(l,i));
d[l][r] = sum[r] - sum[l - 1] - m;
return d[l][r];
}
int main()
{
while (cin >> n && n) {
sum[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> input[i];
sum[i] = sum[i - 1] + input[i];
}
memset(vis, 0, sizeof(vis));
cout << 2 * dp(1, n) - sum[n] << endl;
}
return 0;
}
uva10891
最新推荐文章于 2024-06-22 21:53:36 发布