前缀和 + dp P1043 数字游戏

输入输出样例

输入样例#1： 复制

4 2
4
3
-1
2

输出样例#1： 复制

7
81

因为是环 所以要破链成环

这题是求和 所以用前缀和速度会快一下

代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 105; 
int l[maxn * 2];
int dpm[maxn * 2][maxn * 2][maxn];
int dps[maxn * 2][maxn * 2][maxn];
int n, m;
int mod(int a){
	return ((a % 10) + 10) % 10;
}
int main(){
	cin >> n >> m;
	for(int i = 0; i < n; i++)
		cin >> l[i], l[i + n] = l[i];
	for(int i = 1; i < n * 2; i++)
		l[i] += l[i - 1]; 
	memset(dps, 0x3f3f3f3f, sizeof(dps));
	for(int i = 0; i < 2 * n; i++){
		for(int j = i; j < 2 * n; j++){
			dps[i][j][1] = dpm[i][j][1] = mod(l[j] - l[i - 1]);
		}
	}
	for(int i = 2; i <= m; i++){
		for(int j = 0; j < 2 * n; j++){
			for(int k = j + i - 1; k < 2 * n; k++){
				for(int o = j + i - 2; o < k; o++){
				dps[j][k][i] = min(dps[j][k][i], dps[j][o][i - 1] * mod(l[k] - l[o]));
				dpm[j][k][i] = max(dpm[j][k][i], dpm[j][o][i - 1] * mod(l[k] - l[o]));
			}
			}
		}
	}
	int maxx = -99999, minn = 0x3f3f3f3f;
	for(int i = 0; i < n * 2; i++){
		maxx = max(maxx, dpm[i][i + n - 1][m]);
		minn = min(minn, dps[i][i + n - 1][m]);
	}
	cout << minn << endl;
	cout << maxx << endl;
}