关于maxx的初始值

#include<bits/stdc++.h>
using namespace std;
int dp1[120][120][120],dp2[120][120][120],sum[1145];
int a[1145],n;
int dfs1(int l, int r, int m) {
	if (dp1[l][r][m]!=-1)return dp1[l][r][m];
	if (m == 1)return dp1[l][r][1] = (sum[r] - sum[l - 1])%10;
	int ans = 1e9;
	for (int i = l; i <r; i++) {
		for (int len = 1; len < m; len++) {
			ans = min(ans, (dfs1(l, i, len)*dfs1(i + 1, r, m - len)));
		}
	}
	return dp1[l][r][m] = ans;
}
int dfs2(int l, int r, int m) {
	if (dp2[l][r][m]!=-1)return dp2[l][r][m];
	if (m == 1)return dp2[l][r][1] = (sum[r] - sum[l - 1]) % 10;
	int ans = 0;
	for (int i = l; i < r; i++) {
		for (int len =1; len<m; len++) {
			ans = max(ans, (dfs2(l, i, len) * dfs2(i + 1, r, m - len)));
		}
	}
	return dp2[l][r][m] = ans;
}
signed main() {
	memset(dp1, -1, sizeof(dp1)); memset(dp2, -1, sizeof(dp2));
	int  m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (a[i] < 0)a[i] += 10000;
		a[i] %= 10;
		a[i + n] = a[i];
	}
	for (int i = 1; i <= n * 2; i++)sum[i] = sum[i - 1] + a[i];
	for (int i = 1; i <= n; i++) {
		dfs1(i, n + i-1, m);
		dfs2(i, n + i-1, m);
	}
	int minn = 1e9, maxx = -1e9;
	for (int i = 1; i <= n; i++) {
		minn = min(minn,dp1[i][i + n-1][m]);
		maxx = max(maxx, dp2[i][i + n-1][m]);
	}
	cout << (minn>0?minn:0) << endl << maxx;
}