洛谷P8742题解

本题是一道动规的基本题，滚动数组和记忆化搜索都可解决

下面附上代码

#include <iostream>
#include <cmath>
using namespace std;
const int N = 1e5 + 5;
int a[105], b[N],c[101][N], n, ans;
void dp(int x,int y);
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 1; i <= n - 1; i++)
	{
		b[a[i]] = 1;
		dp(i,a[i]);
	}
	b[a[n]] = 1;
	for (int i = 1; i < N; i++)
	{
		if (b[i] == 1)
			ans++;
	}
	cout << ans;
}
void dp(int x,int y)//记忆化搜索
{
	if (c[x][y] != 1)
	{
		if (x < n)
		{
			c[x][y] = 1;
			b[abs(y + a[x + 1])] = 1;
			dp(x + 1, abs(y + a[x + 1]));
			b[abs(y - a[x + 1])] = 1;
			dp(x + 1, abs(y - a[x + 1]));
			b[y] = 1;
			dp(x + 1, y);
		}
	}
}