题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4960
题意:给定一个长度为n的序列,然后再给出n个数ai,表示合成i个数的代价。每次可以将连续的子序列和成一个数,即为序列中各个项的和。要求将给定长度n的序列变成一个回文串,一个数字只能被合成一次。
思路:参照官方题解:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <set>
#pragma comment (linker, "/STACK:1024000000,1024000000")
using namespace std;
typedef long long ll;
const int maxn = 5010;
struct node
{
int l, r;
} a[maxn];
int dp[maxn][maxn], cnt;
int v[maxn], p[maxn];
long long sum[maxn];
int dfs(int l, int r, int i)
{
if(dp[l][r] != -1) return dp[l][r];
if(l >= r) return dp[l][r] = 0;
dp[l][r] = p[r - l + 1];
for(; i < cnt; i++)
dp[l][r] = min(dp[l][r], p[a[i].l - l + 1] + p[r - a[i].r + 1] + dfs(a[i].l + 1, a[i].r - 1, i + 1));
return dp[l][r];
}
int main()
{
int n;
while(~scanf("%d", &n) && n)
{
sum[0] = 0;
memset(dp, -1, sizeof(dp));
for(int i = 1; i <= n; i++)
{
scanf("%d", &v[i]);
sum[i] = sum[i - 1] + v[i];
}
for(int i = 1; i <= n; i++)
scanf("%d", &p[i]);
cnt = 0;
int p = 1, q = n;
for(; q >= 1; q--)
{
while(p < q && sum[p] - sum[0] < sum[n] - sum[q - 1]) p++;
if(p == q) break;
if(sum[p] - sum[0] == sum[n] - sum[q - 1])
{
a[cnt].l = p;
a[cnt++].r = q;
}
}
cout << dfs(1, n, 0) << endl;
}
return 0;
}