题意:给出一个数字序列,每个数字可以随意增添正负号,问有多少和为0的不同的子串。
思路:DP。用dp[i][j]表示以前i个数字中以i结尾且数字和为j的不同字串数量,然后就可以写出状态转移方程
dp[i][j+a[i]] = (dp[i][j+a[i]]+dp[i-1][j]) % MOD
dp[i][j-a[i]] = (dp[i][j-a[i]]+dp[i-1][j]) % MOD
dp[i][a[i]+BASE]++;
dp[i][-a[i]+BASE]++
最后将所有答案加起来即可。
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
//const int MAXN = 5000000 + 5;
//const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int BASE = 10000;
int n;
int a[1010];
LL dp[1010][20020];
int main() {
//freopen("input.txt", "r", stdin);
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
for(int i = 1; i <= n; i++) {
for(int j = 0; j+a[i] <= 20000; j++) dp[i][j+a[i]] = (dp[i][j+a[i]]+dp[i-1][j]) % MOD;
for(int j = a[i]; j <= 20000; j++) dp[i][j-a[i]] = (dp[i][j-a[i]]+dp[i-1][j]) % MOD;
dp[i][a[i]+BASE]++;
dp[i][-a[i]+BASE]++;
}
LL ans = 0;
for(int i = 1; i <= n; i++) ans = (ans+dp[i][BASE]) % MOD;
cout << ans << endl;
return 0;
}