简答题
偏难
#19782
学习小组 时间限制:1.0 s 内存限制:512.0 MB 输入样例 1 4 2 1 3 2 1 5 6 3 Copy 输出样例 1 12 Copy 输入样例…
学习小组
时间限制:1.0 s
内存限制:512.0 MB

输入样例 1
输出样例 1
输入样例 2
输出样例 2

答案与解析
正确答案:<pre class="brush:cpp;toolbar:false;">#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 305;
int n;
int c[N], a[N];
int f[N][N];
int ans;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(c + 1, c + n + 1);
for (int i = n; i >= 1; i--)
for (int j = 1; j <= n; j++)
for (int k = i; k <= n; k++) {
int diff = 0;
if (i > 1)
diff = c[n - j + 1] - c[j];
f[j][k] = max(f[j][k], f[j - 1][k - i] + a[i] + diff);
if (k == n)
ans = max(ans, f[j][k]);
}
printf("%d\n", ans);
return 0;
}</pre>
这道题暂未补解析。