The Preliminary Contest for ICPC Asia Shanghai 2019 Stone game

https://nanti.jisuanke.com/t/41420

退出当前空位，当作一定取它；

总结：退背包； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e5+2;
const int mod=1e9+7;

ll dp[300*500+9];
int a[309];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    cin>>T;
    while(T--)
    {
        ll sum=0;
        int n;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>a[i],sum+=a[i];
        sort(a+1,a+1+n);

        for(int i=0;i<=sum;i++) dp[i]=0;


        dp[0]=1;
        for(int i=1;i<=n;i++)
        {
            for(int j=sum;j>=a[i];j--)
            {
                dp[j]=(dp[j]+dp[j-a[i]])%mod;
            }
        }

        ll ans=0;

        for(int i=1;i<=n;i++)
        {
            for(int j=a[i];j<=sum;j++)
            {
                dp[j]=(dp[j]-dp[j-a[i]]+mod)%mod;//不取当前的，容量为j的方案数
            }
            for(int j=max((sum+1)/2-a[i],0LL);j<=sum-j-a[i];j++)
            {
                ans=(ans+dp[j])%mod;
            }
        }

        cout<<ans<<endl;
    }

    return 0;
}