【DP】 HDOJ 5000 Clone

很神奇的DP。。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 2005
#define maxm 40005
#define eps 1e-10
#define mod 1000000007
#define INF 1e10
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

int vis[maxn][maxn];
int dp[maxn][maxn];
int num[maxn], n, tot;

int cmp(int a, int b)
{
	return a < b;
}
void init(void)
{
	memset(dp, 0 ,sizeof dp);
	memset(vis, 0, sizeof vis);
}
void read(void)
{
	scanf("%d", &n), tot = 0;
	for(int i = 1; i <= n; i++) scanf("%d", &num[i]);
	for(int i = 1; i <= n; i++) tot += num[i];
}
LL dfs(int pos, int s)
{
	vis[pos][s] = 1;
	if(pos == n) {
		if(s > num[pos]) return dp[pos][s] = 0;
		else return dp[pos][s] = 1;
	}
	int t = min(s, num[pos]);
	for(int i = 0; i <= t; i++) {
		if(vis[pos+1][s-i]) dp[pos][s] += dp[pos+1][s-i];
		else dp[pos][s] += dfs(pos+1, s-i);
		if(dp[pos][s] > mod) dp[pos][s] -= mod;
	}
	return dp[pos][s];
}
void work(void)
{
	sort(num+1, num+n+1, cmp);
	printf("%I64d\n", dfs(1, tot / 2));
}
int main(void)
{
	int _;
	while(scanf("%d", &_)!=EOF) {
		while(_--) {
			init();
			read();
			work();
		}
	}
	return 0;
}