ACdream 1726 A Math game

深搜。不过有一个强大的剪枝。就是假设之后的全部用上都不能达到H，则return。

if (A[n]-A[x-1]+summ< H) return; //A[n]表示前nx项和

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxn = ;
long long  a[maxn], A[maxn];
int flag, n;
long long H;

void DFS(long long summ, int x)
{
    if (summ == H) { flag = ; return; }
    if (x > n) return;
    if (summ > H) return;
    if (A[n] - A[x - ] + summ< H) return;
    DFS(summ + a[x], x + );
    if (flag == ) return;
    DFS(summ, x + );
    if (flag == ) return;
}
int main()
{
    int i;
    while (~scanf("%d%lld", &n, &H))
    {
        flag = ;
        memset(A, , sizeof(A));
        for (i = ; i <= n; i++)
        {
            scanf("%lld", &a[i]);
            A[i] = A[i - ] + a[i];
        }
        DFS(, );
        if (flag) printf("Yes\n");
        else printf("No\n");
    }
    return ;
}