97pts WA on #27求调

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100;
int n,l=N,r,sum,cnt[N],m,a;
bool vis[N];
inline void dfs(int dep,int len,int ans,int las){
    if(dep==0){
        printf("%d",ans);
        exit(0);
    }
    if(len==ans) dfs(dep-1,0,ans,sum);
    // dfs(dep+1,len,ans);
    las=min(las,ans-len);
    for(int i=las;i>=l;i--){
        if(!cnt[i]) continue;
        cnt[i]--;
        dfs(dep,len+i,ans,i);
        cnt[i]++;
        if(len==0||len+i==ans) return ;
    }
}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a);
        if(a>50) continue;
        cnt[a]++;
        sum+=a,r=max(r,a),l=min(l,a);
    }
    for(int i=r;i<=sum/2;i++)
        if(sum%i==0) dfs(sum/i,0,i,r);
    printf("%d",sum);
    return 0;
}