mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
60 lines
1.6 KiB
C++
60 lines
1.6 KiB
C++
|
#include<iostream>
|
||
|
|
#include<cstring>
|
||
|
|
#include<algorithm>
|
||
|
|
#include<cstdio>
|
||
|
|
using namespace std;
|
||
|
|
#define ll long long
|
||
|
|
int dp[90000],sum[2][90000];
|
||
|
|
int mod = 1000000007;
|
||
|
|
int modx = -mod;
|
||
|
|
int num[300];
|
||
|
|
int main(){
|
||
|
|
int t,n;
|
||
|
|
scanf("%d",&t);
|
||
|
|
while(t--){
|
||
|
|
scanf("%d",&n);
|
||
|
|
int total = 0;
|
||
|
|
for(int i = 1; i <= n; i++){
|
||
|
|
scanf("%d",&num[i]);
|
||
|
|
total += num[i];
|
||
|
|
}
|
||
|
|
if(total & 1) total++;
|
||
|
|
memset(dp,0,sizeof(dp));
|
||
|
|
memset(sum,0,sizeof(sum));
|
||
|
|
dp[total] = 1;
|
||
|
|
int tt = total*2;
|
||
|
|
for(int i = 1; i <= n; i++){
|
||
|
|
sum[0][0] = dp[0];
|
||
|
|
sum[1][0] = 0;
|
||
|
|
for(int j = 1;j <= tt; j++){
|
||
|
|
sum[0][j] = sum[0][j-1];
|
||
|
|
sum[1][j] = sum[1][j-1];
|
||
|
|
sum[j&1][j] += dp[j];
|
||
|
|
sum[j&1][j] %= modx;
|
||
|
|
}
|
||
|
|
ll ans = 0;
|
||
|
|
for(int j = 0;j <= num[i]; j++){
|
||
|
|
ans += (ll)dp[j]*((num[i]-j)/2+1);
|
||
|
|
ans %= mod;
|
||
|
|
}
|
||
|
|
int p = (num[i]&1)^1;
|
||
|
|
int res = ans;
|
||
|
|
for(int j = 0;j <= tt; j++){
|
||
|
|
dp[j] = res;
|
||
|
|
int u = j-num[i]-1;
|
||
|
|
u = max(u,0);
|
||
|
|
res += (sum[p][j+1+num[i]] - sum[p][j])%mod;
|
||
|
|
res %= mod;
|
||
|
|
p ^= 1;
|
||
|
|
res -= (sum[p][j] - sum[p][u])%mod;
|
||
|
|
res %= mod;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
int res = dp[total];
|
||
|
|
res %= mod;
|
||
|
|
res = (res+mod)%mod;
|
||
|
|
cout<<res<<endl;
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|